×

Paradigm of computations on the Petri nets. (English. Russian original) Zbl 1307.93260

Autom. Remote Control 75, No. 8, 1369-1383 (2014); translation from Avtom. Telemekh. 2014, No. 8, 19-36 (2014).
Summary: The paradigm of computations on the Petri nets was shown to appreciably speed up the computations and reduce laboriousness of software development owing to the mass parallelism and asynchronous information processing. 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. Indicated were the lines of practical realization of the paradigm such as the development of the technology of programming on the loaded Petri net, technology of translation of the loaded Petri nets to the inhibitory Petri nets, and the efficient hardware processors executing programs in the language of the inhibitory Petri nets. Fast computations are supported by the nets of the Sleptsov class with multiple start of transition at a step.

MSC:

93C65 Discrete event control/observation systems
94C15 Applications of graph theory to circuits and networks
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Peterson, J.L., Petri Net Theory and Modeling of Systems, Englewood Cliffs: Prentice-Hall, 1981. Translated under the title Teoriya setei Petri i modelirovanie sistem, Moscow: Mir, 1984. · Zbl 0461.68059
[2] Kotov, V.E., Seti Petri (Petri Nets), Moscow: Nauka, 1984. · Zbl 0606.68052
[3] Sleptsov, A.I. and Yurasov, A.A., Avtomatizatsiya proektirovaniya upravlyayushchikh sistem gibkikh avtomatizirovannykh proizvodstv (Automated Design of the Control Systems for Flexible Computer-aided Manufacturing), Malinovskii, B.N., Ed., Kiev: Tekhnika, 1986.
[4] Achasova, S.M. and Bandman, O.L., Korrektnost’ parallel’nykh vychislitel’nykh protsessov (Correctness of Parallel Computations), Novosibirsk: Nauka, 1990. · Zbl 0783.68006
[5] Jensen, K., Colored Petri Nets. Basic Concepts, Analysis Methods and Practical Use, 3 vols., New York: Springer, 1997. · Zbl 0883.68098
[6] Lomazova, I.A., <Emphasis Type=”Italic“>Vlozhennye seti Petri: modelirovanie i analiz raspredelennykh sistem s ob”ektnoi strukturoi (Emberdded Petri Nets: Modeling and Analysis of Distributed Systems with Object Sturucture), Moscow: Nauchnyi Mir, 2004. · Zbl 1105.68086
[7] Zaitsev, D.A., Clans of Petri Nets: Verification of Protocols and Performance Evaluation of Networks, Saarbrücken: LAP LAMBERT Acad. Publishing, 2013.
[8] Peng, S.S. and Zhou, M.Ch., Petri Net Based PLC Stage Programming for Discrete-event Control Design, in Systems, Man, and Cybernetics, 2001 IEEE Int. Conf., 2001, vol. 4, pp. 2706-2710. · doi:10.1109/ICSMC.2001.972975
[9] Rossmann, J.; Eilers, K., Translating Robot Programming Language Flow Control into Petri Nets, 1-7 (2011)
[10] Palomeras, N.; Ridao, P.; Carreras, M.; etal., Using Petri Nets to Specify and Execute Missions for Autonomous Underwater Vehicles, 4439-4444 (2009) · doi:10.1109/IROS.2009.5354045
[11] Dodd, R.B., Coloured Petri Net Modelling of a Generic Avionics Mission Computer, Air Operations Division: Defence Science and Technology Organisation, Australia, DSTO-TN-0692, 2006.
[12] Usher, M. and Jackson, D., A Petri Net Based Visual Programming Language, in Systems, Man, and Cybernetics, 1998. IEEE Int. Conf., 1998, vol. 1, pp. 107-112. · doi:10.1109/ICSMC.1998.725393
[13] Iordache, MV; Antsaklis, PJ, Petri Nets and Programming: A Survey, 4994-4999 (2009) · doi:10.1109/ACC.2009.5159987
[14] Voevodin, V.V. and Voevodin, Vl.V., Parallel’nye vychisleniya (Parallel Computations) St. Petersburg: BKnV-Peterburg, 2002.
[15] Zaitsev, DA, Universal Petri Net, 24-39 (2012)
[16] Zaitsev, D.A., Toward the Minimal Universal Petri Net, IEEE Trans. Syst., Man, Cybernet., 2014, vol. 44, no. 1, pp. 47-58. · doi:10.1109/TSMC.2012.2237549
[17] Zaitsev, DA, Inhibitory Petri Net Executing an Arbitrary Defined Turing Machine, 26-41 (2012)
[18] Zaitsev, D.A., Inhibitory Petri Net Executing an Arbitrary Defined Normal Markov Algorithm, Modelir. Anal. Inform. Sist., 2011, vol. 18, no. 4, pp. 80-93.
[19] Sleptsov, AI, State Equations and Equivalent Transformations of Loaded Petri Nets (Algebraic Approach), 151-158 (1988)
[20] Zaitsev, DA; Sleptsov, AI, State Equation and Equivalent Transformations of the Time Petri Nets, 59-76 (1997)
[21] Zaitsev, D.A., Small Polynomial Time Universal Petri Nets, arXiv:1309.7288.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.