Membrane Computing: An Introduction
Membrane Computing: An Introduction
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Logic of Programs and Their Applications, Proceedings
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Applications of Membrane Computing (Natural Computing Series)
Applications of Membrane Computing (Natural Computing Series)
On the ω-language expressive power of extended petri nets
Theoretical Computer Science - Expressiveness in concurrency
P systems with minimal parallelism
Theoretical Computer Science
Labeled Step Sequences in Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
Flattening the transition P systems with dissolution
CMC'10 Proceedings of the 11th international conference on Membrane computing
Towards a petri net semantics for membrane systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
| Hi-index | 0.00 |
In this paper we introduce a class of Petri nets, called catalytic Petri nets, and a suitable firing strategy where transitions are fired only when they use tokens from specific places, called catalytic places. By establishing a one-to-one relationship with catalytic membrane systems, we can prove that the class of catalytic Petri nets with at least two catalytic places is Turing complete.