Toward the Minimal Universal Petri Net

@article{Zaitsev2014TowardTM,
  title={Toward the Minimal Universal Petri Net},
  author={Dmitry A. Zaitsev},
  journal={IEEE Transactions on Systems, Man, and Cybernetics: Systems},
  year={2014},
  volume={44},
  pages={47-58}
}
  • D. Zaitsev
  • Published 2014
  • Computer Science
  • IEEE Transactions on Systems, Man, and Cybernetics: Systems
A universal Petri net with 14 places, 42 transitions, and 218 arcs was built in the class of deterministic inhibitor Petri nets (DIPNs); it is based on the minimal Turing machine (TM) of Woods and Neary with 6 states, 4 symbols, and 23 instructions, directly simulated by a Petri net. Several techniques were developed, including bi-tag system (BTS) construction on a DIPN, special encoding of TM tape by two stacks, and concise subnets that implement arithmetic encoding operations. The simulation… 
A Small Universal Petri Net
TLDR
A universal deterministic inhibitor Petri net was constructed via simulation of Neary and Woods' weakly universal Turing machine with 2 states and 4 symbols; the total time complexity is exponential in the running time of their weak machine.
Small Polynomial Time Universal Petri Nets
TLDR
It is shown that their slight modification and interpretation as timed Petri nets with multichannel transitions, introduced by the author in 1991, allows obtaining polynomial time complexity.
Universal Sleptsov net
  • D. Zaitsev
  • Computer Science
    Int. J. Comput. Math.
  • 2017
TLDR
A universal Sleptsov net with 13 places and 26 transitions that runs in polynomial time is constructed and is a prototype of a processor in the SN paradigm of computing that promises hyper-performance.
Sleptsov Nets Run Fast
  • D. Zaitsev
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics: Systems
  • 2016
We show that Sleptsov place-transition nets (that allow transition firing in multiple instances at a step) run fast by implementing multiplication and division operations in polynomial time. In
Paradigm of computations on the Petri nets
  • D. Zaitsev
  • Computer Science
    Autom. Remote. Control.
  • 2014
TLDR
A language of the programmed Petri nets was developed, alternative approaches to realizing the paradigm at the micro and macro levels were proposed, and the estimates of complexity of the earlier universal Petri net that are prototypes of the corresponding processor were specified.
Petri Net Computers and Workflow Nets
  • F. Ţiplea, R. Diaconu
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics: Systems
  • 2015
TLDR
It is shown that all recursive functions are Pn computable and, vice-versa, PN computable functions are recursive, which shows that the PN computers proposed have exactly the power of Turing machines.
Sleptsov Net Computing
TLDR
Sleptsov net was introduced compared to Petri and Salwicki nets and ways of hierarchical composition of a program via substitution of a transition by a module were discussed.
Petri net Extensions and Restrictions
TLDR
This chapter presents some of the extensions and restrictions to the P/T Petri nets that GPenSIM supports and how to implement them.
Research on Petri Net System Parallel Subnet Partitioning Completeness Theory and Algorithm
In order to solve the parallel algorithm of Petri net system with concurrent function, so as to achieve the parallel control and simulation operation of this system, this paper proposes the function
Programming in the Sleptsov net language for systems control
TLDR
The principles of programming in the Sleptsov net language are further developed with respect to the restrictions on the control flow and its composition with data and additional restrictions on copying parameters of modules and using global variables are formulated.
...
1
2
3
...

References

SHOWING 1-10 OF 31 REFERENCES
Universal petri net
TLDR
An algorithm using only 10 scalar nonnegative integer variables and executing an arbitrary inhibitor net is developed based on the state equation and is encoded by the universal inhibitor Petri net.
A New Synchronisation Model for Multi-Level Object Petri Nets
TLDR
An encoding of the proposed class of object Petrinets into linear logic Petri nets (LLPNs) is given, which directly leads to a specification that can be model-checked by existing tools.
Universal Inhibitor Petri Net
TLDR
The universal inhibitor Petri net was constructed that executes an arbitrary given inhibitor PetRI net and was encoded as 10 scalar nonnegative integer numbers and represented by corresponding places of universal net.
An Axiomatization of the Token Game Based on Petri Algebras
TLDR
A class of residuated commutative monoids, called Petri algebras, are identified, for which one can mimic the token game of Petrinets to define the behaviour of generalized Petri nets whose flow relations and place contents are valued in such algebraic structures.
Petri Net Algebra
This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from Process
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
Deadlock problems in flexible manufacturing systems (FMS) have received more and more attention in the last two decades. Petri nets are one of the more promising mathematical tools for tackling
Petri nets: Properties, analysis and applications
TLDR
The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Petri nets for systems engineering - a guide to modeling, verification, and applications
TLDR
The aim of the book is to illustrate progress in formal methods, based on Petri net formalisms, which contains a collection of examples arising from different fields, such as flexible manufacturing, telecommunication and workflow management systems.
Fault Diagnosis of Discrete-Event Systems Using Continuous Petri Nets
TLDR
This paper defines three diagnosis states, namely N, U, and F, corresponding respectively to no fault, uncertain, and fault state, and proves that, given an observation, the resulting diagnosis state can be computed solving linear programming problems rather than integer programming problems as in the discrete case.
Translating robot programming language flow control into Petri nets
TLDR
This paper describes how structures for the flow control in robot programming languages can be translated into Petri nets, a common representation of robot programs that allows us to apply to them techniques originally developed for Petrinets.
...
1
2
3
4
...