Abstract
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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Ciobanu, G., & Pinna, G. M. (2012). Catalytic Petri nets are turing complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7183 LNCS, pp. 192–203). https://doi.org/10.1007/978-3-642-28332-1_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
