Abstract
We present three methods for the integration of symmetries into reachability analysis. Two of them lead to maximal reduction but their runtime depends on the symmetry structure. The third one works always fast but does not always yield maximal reduction.
Chapter PDF
Similar content being viewed by others
References
G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. On well-formed colored nets and their symbolic reachability graph. Proc. of the 11th Int. Conf. on Application and Theory of Petri Nets, pages 387–410, 1990. 315, 328
E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. Formal Methods in System Design 9, pages 77–104, 1996. 315, 316, 323, 324
G. Chiola, G. Franceschinis, and R. Gaeta. Modelling symmetric computer architectures by swn’s. Proc. 15th Int. Conf. on Application and Theory of Petri Nets, LNCS 815, pages 139–158, 1994. 315, 328
G. Chiola. Manual and automatic exploitation of symmetries in spn models. Proc. 19th International Conference on Application and Theory of Petri nets, LNCS 1420, pages 28–43, 1998. 315
S. Duri, U. Buy, R. Devarapalli, and S. Shatz. Using state space methods for deadlock analysis in ada tasking. ACM Proc. Int. Symp. on Software Testing and Analysis, pages 51–60, 1993. 328
E.A. Emerson, S. Jha, and D. Peled. Combining partial order and symmetry reductions. Proc. TACAS’ 97, LNCS 1217, pages 19–34, 1997. 328
E.A. Emerson and A.P. Sistla. Symmetry and model checking. Formal Methods in System Design 9, pages 105–131, 1996. 315, 324
Huber, A. Jensen, Jepsen, and K. Jensen. Towards reachability trees for high-level petri nets. In Advances in Petri Nets 1984, Lecture Notes on Computer Science 188, pages 215–233, 1984. 315, 321, 323
C.N. Ip and D.L. Dill. Better verification through symmetry. Formal Methods in System Design 9, pages 41–75, 1996. 315, 316, 323
K. Jensen. Coloured Petri Nets, volume 1 of EATCS Monographs on Theoretical Computer Science. Springer, 1992. 315
K. Jensen. Coloured Petri Nets Vol. 2: Analysis Methods. Springer, 1995. 324
T. Junttila. Towards well-formed algebraic system nets. Workshop CSP’98 Berlin, Technical Report 110, Humboldt-University Berlin, pages 116–127, 1998. 315
S. Rochand P. Starke. INA — Integrierter Netz-Analysator Version 1.7. Handbuch. Humboldt-University Berlin, Institute of Computer Science, 1997. 316
K. Schmidt. How to calculate symmetries of petri nets. To appear in Acta Informatica. 316, 317, 321
P. Starke. Reachability analysis of petri nets using symmetries. J. Syst. Anal. Model. Simul., 8:294–303, 1991. 315, 316
R.E. Tarjan. Efficiency ofa good but not linear set union algorithm. Journal of the ACM 22(2), pages 215–225, 1975. 321
A. Valmari. Error detection by reduced reachability graph generation. Proc. of the 9th European Workshop on Application and Theory of Petri Nets, Venice, 1988. 328
A. Valmari. Stubborn sets for coloured petri nets. In The Proceedings of the 12th International Conference on Application and Theory of Petri Nets, pages 102–121, 1991. 328
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt, K. (2000). Integrating Low Level Symmetries into Reachability Analysis. In: Graf, S., Schwartzbach, M. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2000. Lecture Notes in Computer Science, vol 1785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46419-0_22
Download citation
DOI: https://doi.org/10.1007/3-540-46419-0_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67282-1
Online ISBN: 978-3-540-46419-8
eBook Packages: Springer Book Archive