Abstract
This paper presents a general technique for the modular construction ofcomplete prefixes adapted to systems composed ofP etri nets. This construction is based on a definition ofa well-adapted order allowing combination. Moreover, the proposed technique takes into account the symmetries ofthe system to minimize the size ofthe produced complete prefixes. Finally, the technique has been instantiated in an efficient algorithm for systems combining finite state machines and k-bounded queues with k a priori known or not.
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.
Similar content being viewed by others
References
G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Well-formed colored nets and symmetric modeling applications. IEEE Transactions on Computers, 42(11):1343–1360, 1993.
J.-M. Couvreur, S. Grivet, and D. Poitrenaud. Designing a LTL model-checker based on unfolding graphs. In Proc. of ICATPN’2000, volume 1825 of Lecture Notes in Computer Science, pages 364–383. Springer Verlag, 2000.
J.-M. Couvreur and D. Poitrenaud. Detection ofillegal behaviours based on unfoldings. In Proc. of ICATPN’99, volume 1639 of Lecture Notes in Computer Science, pages 364–383. Springer Verlag, 1999.
J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575–591, 1991.
J. Esparza. Model checking using net unfoldings. In Proc. of TAPSOFT’93, volume 668 of Lecture Notes in Computer Science, pages 613–628. Springer Verlag, 1993.
J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of ICALP’2000, number 1853 in LNCS, pages 475–486. Springer-Verlag, 2000.
J. Esparza and S. Römer. An unfolding algorithm for synchronous products of transition system. In Proceedings of CONCUR’99, number 1664 in LNCS, pages 2–20. Springer-Verlag, 1999.
J. Esparza, S. Römer, and W. Vogler. An improvement ofMcMillan’s unfolding algorithm. In Proc. of TACAS’96, volume 1055 of Lecture Notes in Computer Science, pages 87–106. Springer Verlag, 1996.
S. Haddad, J.-M. Ilié, and K. Ajami. A model checking method for partially symmetric systems. In Formal Methods for Distributed System Development, Proc. of FORTE/PSTV’2000, pages 121–136, Pisa, Italy, October 2000. Kluwer Academic Publishers.
R. Langerak and E. Brinksma. A complete finite prefix for process algebra. In Proceedings of the 11th International Conference on Computer Aided Verification, Italy, number 1633 in LNCS, pages 184–195. Springer, 1999.
K.L. McMillan. Using unfoldings to avoid the state explosion problem in the verification ofasync hronous circuits. In Proc. of the 4th Conference on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 164–175. Springer Verlag, 1992.
M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, events structures and domains, part I. Theoretical Computer Science, 13(1):85–108, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Couvreur, JM., Grivet, S., Poitrenaud, D. (2001). Unfolding of Products of Symmetrical Petri Nets. In: Colom, JM., Koutny, M. (eds) Applications and Theory of Petri Nets 2001. ICATPN 2001. Lecture Notes in Computer Science, vol 2075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45740-2_9
Download citation
DOI: https://doi.org/10.1007/3-540-45740-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42252-5
Online ISBN: 978-3-540-45740-4
eBook Packages: Springer Book Archive