Catalytic and communicating Petri nets are Turing complete

DOI10.1016/j.ic.2014.08.008zbMath1309.68137OpenAlexW2009828777WikidataQ57936516 ScholiaQ57936516MaRDI QIDQ476166

Gabriel Ciobanu, G. Michele Pinna

Publication date: 28 November 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.08.008

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Memory associated with membranes systems ⋮ Local time membrane systems and time Petri nets ⋮ A Petri net view of covalent bonds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The power of communication: P systems with symport/antiport
• P systems with minimal parallelism
• Computationally universal P systems without priorities: Two catalysts are sufficient
• Membrane computing. An introduction.
• Contextual nets
• On the \(\omega\)-language expressive power of extended Petri nets
• Synthesis Problem for Petri Nets with Localities
• Catalytic Petri Nets Are Turing Complete
• Flattening the Transition P Systems with Dissolution
• Labeled Step Sequences in Petri Nets
• Petri Nets with Localities and Testing
• Membrane Computing

This page was built for publication: Catalytic and communicating Petri nets are Turing complete