Universal Sleptsov net
From MaRDI portal
Publication:3177465
DOI10.1080/00207160.2017.1283410zbMath1397.68127OpenAlexW2574822115MaRDI QIDQ3177465
Publication date: 25 July 2018
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2017.1283410
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the computational complexity of spiking neural P systems
- State equations and equivalent transformations for timed Petri nets
- Universal Petri net
- Small Weakly Universal Turing Machines
- P-completeness of Cellular Automaton Rule 110
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- On the Computational Complexity of Algorithms
- Small Universal Non-deterministic Petri Nets with Inhibitor Arcs