Universality in Infinite Petri Nets

DOI10.1007/978-3-319-23111-2_12zbMath1415.68154OpenAlexW2184487823MaRDI QIDQ2945886

Dmitry A. Zaitsev

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23111-2_12

zbMATH Keywords

complexitysimulationTuring machinelinear cellular automatoninfinite Petri netuniversal Petri net

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cellular automata (computational aspects) (68Q80)

Related Items

A generalized neighborhood for cellular automata

Uses Software

• TINA

Cites Work

• A note on colored Petri nets
• State equations and equivalent transformations for timed Petri nets
• Small universal register machines
• Partitioned quantum cellular automata are intrinsically universal
• Small Weakly Universal Turing Machines
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
• Counter machines and counter languages
• Four Small Universal Turing Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item