Incremental construction of coverability graphs

Information Processing Letters

Volumn 103, Issue 5, 2007, Pages 203-209

  König, Barbara ^a   Kozioura, Vitali ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

Concurrency; Coverability; Formal methods; Petri nets

Indexed keywords

ABSTRACTING; FORMAL METHODS; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS;

COVERABILITY; COVERABILITY GRAPHS; GRAPH TRANSFORMATION SYSTEMS (GTS);

PETRI NETS;

EID: 34250339310     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.04.002     Document Type: Article

References (15)

1. Baldan P., Corradini A., and König B. A static analysis technique for graph transformation systems. Proc. of CONCUR'01. Lecture Notes in Computer Science vol. 2154 (2001), Springer 381-395
2. Desel J., Juhás G., and Neumair C. Finite unfoldings of unbounded Petri nets. Proc. of ATPN'04 (Application and Theory of Petri Nets). Lecture Notes in Computer Science vol. 3099 (2004), Springer
3. Esparza J., and Melzer S. Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design 16 (2000) 159-189
4. Finkel A. The minimal coverability graph for Petri nets. Proc. of ATPN'91 (Application and Theory of Petri Nets). Lecture Notes in Computer Science vol. 674 (1991), Springer 210-243
5. A. Finkel, G. Geeraerts, J.-F. Raskin, L. Van Begin, A counter-example to the minimal coverability tree algorithm, Technical Report 535, Université Libre de Bruxelles, 2005
6. Karp R.M., and Miller R.E. Parallel program schemata. Journal of Computer and System Sciences 3 2 (1969) 147-195
7. B. König, V. Kozioura, Augur-a tool for the analysis of graph transformation systems, EATCS Bulletin 87, November 2005, pp. 125-137 (appeared in The Formal Specification Column)
8. B. König, V. Kozioura, Augur 2-a new version of a tool for the analysis of graph transformation systems, in: Proc. of GT-VMT'06 (Workshop on Graph Transformation and Visual Modeling Techniques), ENTCS, 2006
9. Mayr E.W. An algorithm for the general Petri net reachability problem. SIAM Journal on Computing 13 3 (1984) 441-460
10. Meseguer J., and Montanari U. Petri nets are monoids. Information and Computation 88 2 (1990) 105-155
11. Reisig W. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science (1985), Springer, Berlin, Germany
12. Reutenauer C. Aspects mathématiques des réseaux de Pétri (1989), Masson
13. In: Rozenberg G. (Ed). Foundations, Handbook of Graph Grammars and Computing by Graph Transformation vol. 1 (1997), World Scientific
14. Schmidt K. Model-checking with coverability graphs. Formal Methods in System Design 15 3 (1999) 239-254
15. Valk R., and Vidal-Naquet G. Petri nets and regular languages. Journal of Computer and System Sciences 23 3 (1981) 299-325