Universality in Infinite Petri Nets
- Cite this paper as:
- Zaitsev D.A. (2015) Universality in Infinite Petri Nets. In: Durand-Lose J., Nagy B. (eds) Machines, Computations, and Universality. MCU 2015. Lecture Notes in Computer Science, vol 9288. Springer, Cham
Finite classical Petri nets are non-Turing-complete. Two infinite Petri nets are constructed which simulate the linear cellular automaton Rule 110 via expanding traversals of the cell array. One net is obtained via direct simulation of the cellular automaton while the other net simulates a Turing machine, which simulates the cellular automaton. They use cell models of 21 and 14 nodes, respectively, and simulate the cellular automaton in polynomial time. Based on known results we conclude that these Petri nets are Turing-complete and run in polynomial time. We employ an induction proof technique that is applicable for the formal proof of Rule 110 ether and gliders properties further to the constructs presented by Matthew Cook.