Finding symmetries of algebraic system nets

Fundamenta Informaticae

Volumn 37, Issue 3, 1999, Pages 269-289

  Junttila, Tommi A ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Algebraic system nets; Petri nets; Reachability analysis; Symmetries

Indexed keywords

EID: 0040364637     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-37305     Document Type: Article

References (29)

1. K. Ajami, S. Haddad, and J-M. Ilié. Exploiting symmetry in linear time temporal logic model checking: One step beyond. In B. Steffen, editor, Tools and Algorithms for the Construction and Analysis of Systems; 4th International Conference, TACAS'98, Lisbon, Portugal, March/April 1998, volume 1384 of Lecture Notes in Computer Science, pages 52-67. Springer-Verlag, Berlin, Germany, 1998.
2. J. Billington. Many-sorted high-level nets. In Proceedings of the Third International Workshop on Petri Nets and Performance Models (PNPM89), pages 166-179, Kyoto, Japan, 11-13 December 1989. IEEE Computer Society Press. Reprinted in [20], pages 123-136.
3. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. On well-formed coloured nets and their symbolic reachability graph. In Jensen and Rozenberg [20], pages 373-396.
4. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. A symbolic reachability graph for coloured Petri nets. Theoretical Computer Science, 176:39-65, 1997.
5. E. M. Clarke, E. A. Emerson, S. Jha, and A. P. Sistla. Symmetry reductions in model checking. In Hu and Vardi [13], pages 147-158.
6. E. M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. Formal Methods in System Design, 9(1/2):77-104, August 1996.
7. E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9(1/2):105-131, August 1996.
8. E. A. Emerson and A. P. Sistla. Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach. ACM Transactions on Programming Languages and Systems, 19(4):617-638, July 1997.
9. H. J. Genrich. Predicate/transition nets. In Jensen and Rozenberg [20], pages 3-43.
10. R. P. Grimaldi. Discrete and Combinatorial Mathematics. Addison-Wesley Publishing Company, Reading, Massachusetts, USA, 1985.
11. O. Grumberg, editor. Computer Aided Verification: 9th International Conference, CAV'97, Haifa, Israel, June 1997, volume 1254 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 1997.
12. V. Gyuris and A. P. Sistla. On-the-fly model checking under fairness that exploits symmetry. In Grumberg [11], pages 232-243.
13. A. J. Hu and M. Y. Vardi, editors. Computer Aided Verification: 10th International Conference, CAV'98, Vancouver, BC, Canada, June/July 1998, volume 1427 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 1998.
14. P. Huber, A. M. Jensen, L. O. Jepsen, and K. Jensen. Towards reachability trees for high-level Petri nets. In G. Rozenberg, editor, Advances in Petri Nets 1984, volume 188 of Lecture Notes in Computer Science, pages 215-233. Springer-Verlag, Berlin, Germany, 1985.
15. P. Huber, A. M. Jensen, L. O. Jepsen, and K. Jensen. Reachability trees for high-level Petri nets. In Jensen and Rozenberg [20], pages 319-350.
16. International Organization for Standardization. Committee Draft ISO/IEC 15909: High-level Petri Nets - Concepts, Definitions and Graphical Notation, October 2, 1997. Version 3.4.
17. C. N. Ip and D. L. Dill. Better verification through symmetry. Formal Methods in System Design, 9(1/2):41-76, August 1996.
18. K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Volume 2, Analysis Methods. Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1995.
19. K. Jensen. Condensed state spaces for symmetrical coloured Petri nets. Formal Methods in System Design, 9(1/2):7-40, August 1996.
20. K. Jensen and G. Rozenberg, editors. High-level Petri Nets; Theory and Application. Springer-Verlag, Berlin, Germany, 1991.
21. T. A. Junttila. Towards well-formed algebraic system nets. In H.-D. Burkhard, L. Czaja, and P. Starke, editors, Workshop Concurrency, Specification & Programming, number 110 in Informatik-Bericht, pages 116-127. Humboldt-Universität zu Berlin, 1998.
22. E. Kindler and W. Reisig. Algebraic system nets for modelling distributed algorithms. Petri Net Newsletter, 51:16-31, December 1996.
23. E. Kindler and H. Völzer. Flexibility in algebraic nets. In J. Desel and M. Silva, editors, Application and Theory of Petri Nets 1998; Proceedings of the 19th International Conference, ICATPN'98; Lisbon, Portugal, June 1998, volume 1420 of Lecture Notes in Computer Science, pages 345-364. Springer-Verlag, Berlin, Germany, 1998.
24. G. S. Manku, R. Hojati, and R. Brayton. Structural symmetry and model checking. In Hu and Vardi [13], pages 159-171.
25. M. Pandey and R. E. Bryant. Exploiting symmetry when verifying transistor-level circuits by symbolic trajectory evaluation. In Grumberg [11], pages 244-255.
26. W. Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80(1):1-34, March 1991. Reprinted in [20], pages 137-170.
27. K. Schmidt. How to calculate symmetries of Petri nets. Technical Report MATH-AL-8-1997, Technische Universität Dresden, Germany, September 1997. Revised version accepted for publication in Acta Informatica.
28. K. Schmidt and P. H. Starke. An algorithm to compute the symmetries of Petri nets. Petri Net Newsletter, 40:25-30, December 1991.
29. P. H. Starke. Reachability analysis of Petri nets using symmetries. Journal of Mathematical Modelling and Simulation in System Analysis, 8(4/5):293-303, 1991.