State space analysis of Petri nets with relation-algebraic methods

Journal of Symbolic Computation

Volumn 44, Issue 1, 2009, Pages 15-47

  Fronk, Alexander ^a   Kehden, Britta ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Petri nets; Reachability graph; Relation algebra; State space analysis; Systems analysis

Indexed keywords

EID: 56349158282     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2008.04.005     Document Type: Article

References (35)

1. Behnke R., Berghammer R., Meyer E., and Schneider P. RelView - A system for calculating with relations and relational programming. In: Astesiano E. (Ed). Proceedings of the 1st International Conference on Fundamental Approaches to Software Engineering. Lecture Notes in Computer Science (LNCS) vol. 1382 (1996), Springer 318-321
2. Berghammer R. Relation-algebraic computation of fixed points with applications. Journal of Logic and Algebraic Programming 66 (2006) 112-126
3. Berghammer R., and Fronk A. Exact computation of minimum feedback vertex sets with relational algebra. Fundamenta Informaticae 70 4 (2006) 301-316
4. Berghammer R., Karger B., and Ulke C. Relational-algebraic analysis of Petri nets with RelView. In: Margaria T., and Steffen B. (Eds). Proceedings of the 2nd Workshop on Tools and Applications for the Construction and Analysis of Systems (TACAS '96). Lecture Notes in Computer Science (LNCS) vol. 1055 (1996), Springer 49-69
5. Berghammer R., Leoniuk B., and Milanese U. Proceedings of the 6th International Workshop on Relational Methods in Computer Science, RelMiCS6. In: de~Swart H. (Ed). Lecture Notes in Computer Science (LNCS) vol. 2561 (2002), Springer 241-257
6. Bieber B., and Fleischhack H. Model checking of time Petri nets based on partial order semantics. In: Baeten J.C.M., and Mauw S. (Eds). Proceedings of the 10th International Conference on Concurrency Theory. Lecture Notes in Computer Science (LNCS) vol. 1664 (1999), Springer 210-255
7. Corradini A., Große-Rhode M., and Heckel R. A coalgebraic presentation of structured transition systems. Theoretical Computer Science 260 (2001) 27-55
8. Dingle N., Harrison P., and Knottenbelt W. Response time densities in generalised stochastic petri net models. Proceedings of the 3rd International Workshop on Software and Performance (2002), ACM Press 46-54
9. Emerson, E.A., Namjoshi, K.S., 1998. On model checking for non-deterministic infinite-state systems. In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science. pp. 70-80
10. Esparza J. Decidability of model checking for infinite-state concurrent systems. Acta Informatica 34 (1997) 85-107
11. Esparza J., and Heljanko K. A new unfolding approach to LTL model checking. In: Montanari U., Rolim J.D.P., and Welzl E. (Eds). Proceedings of the 27th~International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science (LNCS) vol. 1853 (2000), Springer-Verlag 475-486
12. Esparza J., and Nielsen M. Decidability issues for Petri nets - a survey. Journal of Information Processing and Cybernetics 30 3 (1994) 143-160
13. Esparza J., and Schröter C. Unfolding based algorithms for the reachability problem. Fundamenta Informaticae 47 3-4 (2001) 231-245
14. Finkel A. The Minimal Coverability Graph for Petri Nets. In: Rozenberg G. (Ed). Advances in Petri Nets. Lecture Notes in Computer Science (LNCS) vol. 674 (1993), Springer 210-243
15. Fronk A. Using relation algebra for the analysis of Petri nets in a CASE tool based approach. 2nd IEEE International Conference on Software Engineering and Formal Methods, SEFM (2004), IEEE, Beijing 396-405
16. Fronk, A., 2006. Relation-algebraic Analysis of Petri Nets. Script available at ftp://ls10-ftp.cs.uni-dortmund.de/pub/Lehre/PetRA-WiSe0506/Skript.pdf, Lehrstuhl Software-Technologie, Universität Dortmund (in German)
17. Fronk, A., Kehden, B., 2006. State space analysis of petri nets with relation-algebraic methods. Memorandum 163, Lehrstuhl Software-Technologie, Universität Dortmund
18. Fronk, A., Pleumann, J., 2005a. Petri net analysis based on relation algebra, http://ls10-www.cs.uni-dortmund.de/index.php?id=134
19. Fronk A., and Pleumann J. Relation-algebraic analysis of petri nets: Concepts and implementation. Petri Net News Letters (2005) 61-68
20. Fronk, A., Pleumann, J., Schönlein, R., Szymanski, O., 2005. KURE-Java, http://ls10-www.cs.uni-dortmund.de/index.php?id=136
21. Kehden B. Evaluating sets of search points using relational algebra. Proceedings of the 9th International Conference on Relational Methods in Computer Science, RelMiCS 9. LNCS vol. 4136 (2006), Springer 266-280
22. Konikowska B., and Orlowska E. A relational formalisation of a generic many-valued modal logic. In: Orlowska E., and Szalas A. (Eds). Relational methods for computer science applications. Studies in Fuzziness and Soft Computing (2001), Physica-Verlag 183-202
23. Latvala T., and Heljanko K. Coping with strong fairness. Fundamenta Informaticae 34 (2000) 1-19
24. Leuschel M., and Massart T. Infinite state model checking by abstract interpretation and program specialisation. In: Bossi A. (Ed). Proceedings of Logic-Based Program Synthesis and Transformation. Lecture Notes in Computer Science (LNCS) vol. 1817 (1999), Springer 63-82
25. Milanese, U., 2003. KURE: Kiel University Relation Package, http://cvs.informatik.uni-kiel.de/~kure/
26. Notomi M., and Murata T. Hierarchical reachability graph of bounded petri nets for concurrent-software analysis. IEEE Transactions on Software Engineering 20 5 (1994) 325-336
27. Pastor E., Roig O., Cortadella J., and Badia R.M. Petri net analysis using boolean manipulation. In: Valette R. (Ed). Proceedings of the 15th International Conference on Application and Theory of Petri Nets. Lecture Notes in Computer Science (LNCS) vol. 815 (1994), Springer 416-435
28. Schlinghoff H., and Heinle W. Relation algebra and modal logics. Relational Methods in Computer Science. Advances in Computer Science (1996), Springer 70-89
29. Schmidt G., and Ströhlein T. Relations and graphs. EATCS Monographs on Theoretical Computer Science (1993), Springer
30. Starke P.H. Analyse von Petri-Netz-Modellen (1990), Teubner
31. Tarski A., and Givant S. A Formalization of Set Theory without Variables. Amer. Math. Soc. vol.~41 (1987), Amer. Math. Soc. Colloq. Publ.
32. Valmari A. Stubborn sets for reduced state space generation. In: Rozenberg G. (Ed). Advances in Petri Nets. Lecture Notes in Computer Science (LNCS) vol. 483 (1990), Springer 491-515
33. Valmari A. The state explosion problem. Lectures on Petri nets: Advances in Petri nets (1998), Springer 429-473
34. Wegener, I., 2000. Branching programs and binary decision diagrams. In: SIAM Monographs on Discrete Mathematics and Applications
35. Woodside, C.M., Li, Y., 1991. Performance petri net analysis of communication protocol software by delay-equivalent aggregation. In: Proceedings of the 4th International Workshop on Petri nets and Performance Models, pp. 64-73