Abstract
Petri nets, a popular discrete automaton model, are convenient for describing some parallel operations. A net used for such purpose cannot be a closed system but has to contain input and output places. Such a model is defined here as an operational Petri net.
Analysis of Petri nets is a difficult task. In the paper the method of analysis is suggested, based on the original approach to decomposition and oriented for the considered class of nets. Applying the approach to the cyclic nets is also considered. Some experimental results are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Peterson J.L. Petri net theory and the modeling of systems. — Prentice-Hall, Inc., Englewood Cliffs, 1981.
Notomi M., Murata T. Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis. IEEE Transactions on software engineering, Vol. 20, No 5, May 1994.-pp. 325–336.
Banaszak Z., Kus J., Adamski M. Sieci Petriego. Modelowanie, Sterowanie i Sinteza Systemów Dyskretnych.-Wydawnictwo WSInż, Zielona Góra, 1993.
Zakrevskij A.D. Analysis of the operational Petri nets.-Minsk, 1987.-(Preprint — Institute of Engineering Cybernetics of the Academy of Sc. of BSSR, № 44) (in Russian).
Zakrevskij A.D. Decomposition approach to analysis of parallel logical control algorithms.-Formal models of parallel computation.-Novosibirsk: Siberian section of the Academy of Sc. of USSR, 1988.-pp. 127–135 (in Russian).
Murata T. Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE, Vol. 77, No. 4, 1989, pp. 541–580.
Zakrevskij A.D.Parallel algorithms for logical control.-Inst, of Engineering Cybernetics of NAS of Belarus, Minsk, 1999 (in Russian).
Karatkevich A.G. Correctness analysis of α-nets. — Logical design, Vol. 1, Inst, of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk, 1996, pp. 86–96 (in Russian).
Pottosin Yu. V. Generating parallel automata. Methods and algorithms of logical design.-Inst, of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk, 1995, pp. 132–142 (in Russian).
Karatkevich A. Optimal Simulation of α-Nets.-Proceedings of the Polish-German Symposium on SRE’2000, Zielona Góra, 2000.-P. 217–222.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zakrevskij, A., Karatkevich, A., Adamski, M. (2002). A Method of Analysis of Operational Petri Nets. In: Sołdek, J., Pejaś, J. (eds) Advanced Computer Systems. The Springer International Series in Engineering and Computer Science, vol 664. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8530-9_36
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8530-9_36
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4635-7
Online ISBN: 978-1-4419-8530-9
eBook Packages: Springer Book Archive