New canonical representative marking algorithms for place/transition-nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3099, Issue , 2004, Pages 258-277

  Junttila, Tommi A ^a,b  

^a AALTO UNIVERSITY   (Finland)

^b ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS;

BACKTRACK SEARCH; CANONICAL REPRESENTATIVES; CORE PROBLEMS; GRAPH ISOMORPHISM; MARKING ALGORITHM; NET ELEMENTS; PREPROCESSING TECHNIQUES; STATE-SPACE ANALYSIS;

ALGORITHMS;

EID: 35048880270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27793-4_15     Document Type: Article

References (26)

1. Starke, P.H.: Reachability analysis of Petri nets using symmetries. Systems Analysis Modelling Simulation 8 (1991) 293-303
2. Schmidt, K.: How to calculate symmetries of Petri nets. Acta Informatica 36 (2000) 545-590
3. Schmidt, K.: 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. Volume 1785 of LNCS., Springer (2000) 315-330
4. Junttila, T.A.: Computational complexity of the Place/Transition-net symmetry reduction method. Journal of Universal Computer Science 7 (2001) 307-326
5. Junttila, T.: On the symmetry reduction method for Petri nets and similar formalisms. Research Report A80, Helsinki Univ. of Technology, Lab. for Theoretical Computer Science (2003) Doctoral dissertation.
6. Butler, G.: Fundamental Algorithms for Permutation Groups. Volume 559 of LNCS. Springer (1991)
7. McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30 (1981) 45-87
8. Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration and Search. CRC Press, Boca Raton, Florida, USA (1999)
9. Schmidt, K.: LoLA: A low level analyser. In Nielsen, M., Simpson, D., eds.: Application and Theory of Petri Nets 2000, ICATPN 2000. Volume 1825 of LNCS., Springer (2000) 465-474
10. Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Volume 2, Analysis Methods. Monographs in Theoretical Computer Science. Springer (1995)
11. Emerson, E.A., Sistla, A.P.: Symmetry and model checking. Formal Methods in System Design 9 (1996) 105-131
12. Clarke, E.M., Enders, R., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. Formal Methods in System Design 9 (1996) 77-104
13. Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods in System Design 9 (1996) 41-76
14. Emerson, E.A., Sistla, A.P.: Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach. ACM Transactions on Programming Languages and Systems 19 (1997) 617-638
15. Gyuris, V., Sistla, A.P.: On-the-fly model checking under fairness that exploits symmetry. Formal Methods in System Design 15 (1999) 217-238
16. Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: On well-formed coloured nets and their symbolic reachability graph. [26] 373-396
17. Junttila, T.: Detecting and exploiting data type symmetries of algebraic system nets during reachability analysis. Research Report A57, Helsinki Univ. of Technology, Lab. for Theoretical Computer Science (1999)
18. Ip, C.N.: State Reduction Methods for Automatic Formal Verification. PhD thesis, Department of Computer Science, Stanford University (1996)
19. Huber, P., Jensen, A.M., Jepsen, L.O., Jensen, K.: Towards reachability trees for high-level Petri nets. Technical Report DAIMI PB 174, Datalogisk Afdeling, Matematisk Institut, Aarhus Universitet (1985)
20. Sistla, A.P., Gyuris, V., Emerson, E.A.: SMC: A symmetry-based model checker for verification of safety and liveness properties. ACM Transactions on Software Engineering and Methodology 9 (2000) 133-166
21. Junttila, T.: Symmetry reduction algorithms for data symmetries. Research Report A72, Helsinki Univ. of Technology, Lab. for Theoretical Computer Science (2002)
22. Lorentsen, L., Kristensen, L.M.: Exploiting stabilizers and parallelism in state space generation with the symmetry method. In: Proceedings of the Second International Conference on Application of Concurrency to System Design (ACSD 2001), IEEE Computer Society (2001) 211-220
23. Genrich, H.J.: Predicate/transition nets. [26] 3-43
24. Jerrum, M.: A compact representation for permutation groups. Journal of Algorithms 7 (1986) 60-78
25. Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Volume 1, Basic Concepts. Second edn. Monographs in Theoretical Computer Science. Springer (1992)
26. Jensen, K., Rozenberg, G., eds.: High-level Petri Nets; Theory and Application, Springer (1991)