Abstract
The paper formalizes the concept of the unfolding for unbounded hybrid Petri nets and introduces the algorithm for its computing. The unfolding is a useful partial-order based method for analysis and verification of the Petri net properties. This technique can cope well with the so-called state space explosion problem, especially for the Petri nets with a lot of concurrency.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Reisig, W.: Petri Nets - an Introduction, Berlin (1985)
Desel, J., Juhás, G.: What Is a Petri Net? In: Ehrig, H., Juhás, G., Padberg, J., Rozenberg, G. (eds.) APN 2001. LNCS, vol. 2128, pp. 1–25. Springer, Heidelberg (2001)
David, R., Alla, H.: Continuous Petri nets. In: Proc. of the 8th European Workshop on Application an Theory of Petri Nets, Zaragoza, Spain, pp. 275–294 (1987)
Recalde, L., Teruel, E., Silva, M.: Autonomous Continuous P/T Systems. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 107–126. Springer, Heidelberg (1999)
David, R., Alla, H.: Continuous and hybrid Petri nets. Journal of Circuits, Systems, and Computers (1998)
David, R., Alla, H.: Discreet, Continuous and hybrid Petri nets. Springer, Berlin (2005)
McMillan, K.L.: A Technique of State Space Search Based on Unfolding. Formal Methods in System Design 6, 45–65 (1995)
Esparza, J., Romer, S., Vogler, W.: An Improvement of McMillan’s Unfolding Algorithm. Formal Methods in System Design 20 (2002)
Esparza, J., Heljanko, K.: Unfoldings - a partial-order approach to model checking. EATCS Monographs in Theoretical Computer Science. Springer (2008)
Khomenko, V., Koutny, M.: Towards an Efficient Algorithm for Unfolding Petri Nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 366–380. Springer, Heidelberg (2001)
Weidlich, M., Elliger, F., Weske, M.: Generalised Computation of Behavioural Profiles Based on Petri-Net Unfoldings. In: Bravetti, M., Bultan, T. (eds.) WS-FM 2010. LNCS, vol. 6551, pp. 101–115. Springer, Heidelberg (2011)
Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)
Novosad, P., Češka, M.: Algorithms for Computing Coverability Graphs for Hybrid Petri Nets. In: MEMICS, pp. 177–183. MUNI, Brno (2008)
Novosad, P., Češka, M.: Unfoldings of Bounded Hybrid Petri Nets. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2011, Part I. LNCS, vol. 6927, pp. 543–550. Springer, Heidelberg (2012)
Desel, J., Juhás, G., Neumair, C.: Finite Unfoldings of Unbounded Petri Nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 157–176. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Novosad, P., Češka, M. (2013). Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2013. EUROCAST 2013. Lecture Notes in Computer Science, vol 8111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53856-8_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-53856-8_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53855-1
Online ISBN: 978-3-642-53856-8
eBook Packages: Computer ScienceComputer Science (R0)