2012 | OriginalPaper | Chapter
Catalytic Petri Nets Are Turing Complete
Authors : Gabriel Ciobanu, G. Michele Pinna
Published in: Language and Automata Theory and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.