Abstract
Lately, some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood just looking at their topology, that is, information flow. This line of research is very promising for several aspects: (i) its results are valid for a broad range of systems based on multiset rewriting; (ii) it allows to know the computational power of abstract computing devices without tedious proofs; (iii) it links computational power to topology and, in this way, it opens a broad range of questions. In this paper we summarise the known results on this topic and we list a few suggestions for research together with the relevance of possible outcomes. © 2011 World Scientific Publishing Company.
Original language | English |
---|---|
Pages (from-to) | 179-190 |
Number of pages | 12 |
Journal | International Journal of Foundations of Computer Science |
Volume | 22 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 2011 |
Keywords
- P systems
- Petri nets
- Topology of information flow