Abstract
Anapproach to Petri net analysis by state space construction is presented in the paper, allowing reducing the necessary memory amount by means of removing from memory the information on some of intermediate states. Applicability of the approach to deadlock detection and some other analysis tasks is studied. Besides this, a method of breaking cycles in oriented graphs is described.
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
T. Murata, Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4), 548–580 (April 1989).
M. Heiner, Petri net-based system analysis without state explosion. High Performance Computing’ 98, Boston, pp. 1–10 (April 1998).
A. Valmari, The state explosion problem. In: W. Reisicg, G. Rozenberg (eds.), Lectures on Petri Nets I: Basic Models, LNCS Tutorials, LNCS 1491, Springer-Verlag pp. 429–528, (1998).
A. Valmari, State of the art report: Stubborn sets. Petri Nets Newsletter, 46, 6–14 (1994).
C. Girault, R. Valk Petri Nets for System Engineering: A Guide to Modeling, Verification, and Applications, Springer-Verlag (2003).
A. Karatkevich, M. Adamski, Deadlock analysis of Petri nets: Minimization of memory amount. In: Proceedings of 3rd ECS Conference, Bratislava, pp. 69–72 (2001).
A.G. Karatkevich, Dynamic reduction of Petri net reachability graphs. Radioelektronika i Informatika, 18(1), 76–82, Kharkov (2002) (in Russian).
A. Karatkevich, On algorithms for decyclisation of oriented graphs. In: DESDes’01. Przytok, Poland, pp. 35–40 (2001).
R. Janicki, M. Koutny, Optimal simulation, nets and reachability graphs. Technical Report No. 01-09, McMaster University, Hamilton (1991).
A. Karatkevich, Optimal simulation of α-nets. In: SRE-2000. Zielona Góra, pp. 205–210 (2000).
A. Lempel, Minimum feedback arc and vertex sets of a directed graph IEEE Transactions on Circuit Theory, CT-13(4), 399–403 (December 1966).
N. Deo, Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall, New Jersey (1974).
B. Thelen, Investigation of Algorithms for Computer-Aided Logic Design of Digital Circuits. University of Karlsruhe (1988) (in German).
H.-J. Mathony, Universal logic design algorithm and its application to the synthesis of two-level switching circuits. In: Proceedings of the IEE, 136(3), 171–177 (1989).
J. Bieganowski, A. Karatkevich, Heuristics for Thelen’s prime implicant method. In: MSK, Krakow, pp. 71–76 (November 2003) (in Polish).
A. Węgrzyn, A. Karatkevich, J. Bieganowski, Detection of deadlocks and traps in Petri nets by means of Thelen’s prime implicant method, AMCS, 14(1), 113–121 (2004).
O. Coudert, J.K. Madre, New ideas for solving covering problems. In: Proceedings of the 32nd ACM/IEEE Conference on Design Automation, San Francisco, California, United States, pp. 641–646 (1995).
T.H. Cormen, Ch.E. Leiserson, R.L. Rivest, Introduction to Algorithms. MIT (1994).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Karatkevich, A. (2005). Memory-Saving Analysis of Petri Nets. In: Design of Embedded Control Systems. Springer, Boston, MA. https://doi.org/10.1007/0-387-28327-7_6
Download citation
DOI: https://doi.org/10.1007/0-387-28327-7_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23630-8
Online ISBN: 978-0-387-28327-2
eBook Packages: EngineeringEngineering (R0)