How to calculate symmetries of Petri nets

Acta Informatica

Volumn 36, Issue 7, 2000, Pages 545-590

  Schmidt, Karsten ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034349062     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050002     Document Type: Article

References (28)

1. [CDFH90] G. Chiola, C. Dutheillet, G. Franceschinis, 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, pp 387-410, 1990
2. [CEFJ96] E.M. Clarke, R. Enders, T. Filkorn, S. Jha: Exploiting symmetry in temporal logic model checking. Formal Methods in System Design, 9, 77-104 (1996)
3. [CF90] G. Chiola, G. Franceschinis: Colored gspn models and automatic symmetry detection. In Proceedings of the 3rd Int. Workshop on Petri Nets and Performance Models 1989, Kyoto, Japan - Los Alamitos, CA, USA, pp 50-60. IEEE Computer Society Press, 1990
4. [CFG94] G. Chiola, G. Franceschinis, R. Gaeta: Modeling symmetric computer architectures by swns. Proceedings of the 15th Int. Conf. on Application and Theory of Petri nets, Zaragoza, Spain. LNCS 815, 139-158 (1994)
5. [Cha82] E.J.H. Chang: Echo algorithms: Depth parallel operations on general graphs. IEEE Trans Software Eng, SE 8(4), 391-401 (1982)
6. [DH91] C. Dutheillet, S. Haddad: Regular stochastic petri nets. Advances in Petri Nets 1990. LNCS 483, 186-209 (1991)
7. [ES96] E.A. Emerson, A. P. Sistla: Symmetry and model checking. Formal Methods in System Design 9, 105-131 (1996)
8. [GC95] R. Gaeta, G. Chiola: Efficient simulation of swn models. In Proc. of 6th Int. Workshop on Petri Nets and Performance Models, Durham, pp 137-146. IEEE Computer Soc. Press, 1995
9. [HIMZ95] S. Haddad, J. M. Ilié, M. Taghelit, B. Zouari: Symbolic reachability graph and partial symmetries. 16th International Conference on Application and Theory of Petri nets, pp 238-257, 1995
10. [HJJJ84] P. Huber, A. Jensen, L.O. Jepsen, K. Jensen: Towards reachability trees for high-level petri nets. In Advances in Petri Nets 1984, Lecture Notes on Computer Science 188, pp 215-233, 1984
11. [Jen92] K. Jensen: Coloured Petri Nets, volume 1 of EATCS Monographs on Theoretical Computer Science. Berlin, Heidelberg, New York, Springer, 1992
12. [Jen96] K. Jensen: Condensed state spaces for symmetrical coloured petri nets. Formal Methods in System Design 9, 7-40 (1996)
13. [KRVW97] E. Kindler, W. Reisig, H. Völzer, R. Walter: Petri net based verification of distributed algorithms: an example. Formal Aspects of Computing 9, pp 409-424, 1997
14. [Pet90] L. Petrucci: Combining finkels and jensens reduction technique to build covering trees for coloured nets. Petri Net Newsletter 36, 32-36 (1990)
15. [Rei85] W. Reisig: Petri Nets. EATCS Monographs on Theoretical Computer Science, 1985
16. [Rei98] W. Reisig: Elements of Distributed Algorithms. Berlin, Heidelberg, New York, Springer, 1998
17. [RS97] S. Roch, P. Starke: INA - Integrierter Netz-Analysator Version 1.7. Handbuch. Humboldt-University Berlin, Institute of Computer Science, 1997
18. [Sch93] K. Schmidt: Symmetries of petri nets. Petri Net Newsletter 43, 9-25 (1993)
19. [SS91] K. Schmidt, P.H. Starke: An algorithm to compute the symmetries of petri nets. Petri Net Newsletter 40, 25-30 (1991)
20. [Sta90] P. Starke: Analyse von Petri-Netz-Modellen. B.C. Teubner Stuttgart, 1990
21. [Sta91] P. Starke: Reachability analysis of petri nets using symmetries. J. Syst. Anal. Model. Simul. 8, 294-303 (1991)
22. [Tar79] R.E. Tarjan: A class of algorithms which require nonlinear time to maintain disjoint sets. J Comput Syst Sci 18(2), 110-127 (1979)
23. [Tar83] R.E. Tarjan: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983
24. [Tiu94] M. Tiusanen: Symbolic, symmetry and stubborn set searches. In: R. Valette (ed) Proceedings of the 15th International Conference on Application and Theory of Petri Nets in Zaragoza, pp 511-530. Berlin, Heidelberg, New York, Springer, 1994
25. [Val78] R. Valk: Self-modifying nets, a natural extension of petri nets. Automata, Languages and Programming, LNCS, 62, 464-476 (1978)
26. [Val91] A. Valmari: Stubborn sets for coloured petri nets. In The Proceedings of the 12th International Conference on Application and Theory of Petri Nets, pp 102-121, 1991
27. [VHHP95] K. Varpaaniemi, J. Halme, K. Hiekkanen, T. Pyssysalo: Prod reference manual. Technical Report B13, Digital Systems Laboratory, Helsinki University of Technology, August 1995
28. +97] M. Weber, R. Walter, T. Vesper, W. Reisig, E. Kindler, J. Freiheit, J. Desel: DAWN - Petrinetzmodelle zur Verifikation Verteilter Algorithmen. Technical Report 88, Humboldt-University Berlin, 1997