Verifying finite-state graph grammars: An unfolding-based approach

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

Volumn 3170, Issue , 2004, Pages 83-98

  Baldan, Paolo ^a   Corradini, Andrea ^b   König, Barbara ^c  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; FORMAL LOGIC; PETRI NETS; SEMANTICS;

AS GRAPH; FINITE STATE; FINITE STATE SYSTEMS; GRAPH TRANSFORMATION SYSTEM; MONADIC SECOND-ORDER LOGIC; UNFOLDING SEMANTICS;

GRAPH THEORY;

EID: 35048896452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_6     Document Type: Article

References (23)

1. P. Baldan, A. Corradini, and B. König. A static analysis technique for graph transformation systems. In Proc. of CONCUR 2001, pages 381-395. Springer, 2001. LNCS 2154.
2. P. Baldan, A. Corradini, and B. König. An unfolding-based approach for the verification of finite-state graph grammars. Technical report, Dipartimento di Informatica, Universita Ca" Foscari di Venezia, 2004. To appear.
3. P. Baldan, A. Corradini, and U. Montanari. Unfolding and Event Structure Semantics for Graph Grammars. In Proc. of FoSSaCS '99, pages 73-89. Springer, 1999. LNCS 1578.
4. P. Baldan, A. Corradini, and U. Montanari. Contextual Petri nets, asymmetric event structures and processes. Information and Computation, 171(l):l-49, 2001.
5. P. Baldan, B. König, and B. König. A logic for analyzing abstractions of graph transformation systems. In Proc. of SAS'03, pages 255-272. Springer, 2003. LNCS 2694.
6. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26:241-265, 1996.
7. A. Corradini, U. Montanari, P. Rossi, H. Ehrig, R. Heckel, and M. Löwe. Algebraic Approaches to Graph Transformation I: Basic Concepts and Double Pushout Approach. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 1: Foundations. World Scientific, 1997.
8. B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations. World Scientific, 1997.
9. H. Ehrig, J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 3: Concurrency, Parallelism and Distribution. World Scientific, 1999.
10. J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2-3):151-195, 1994.
11. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan's unfolding algorithm. Formal Methods in System Design, 20(20):285-310, 2002.
12. F. Gadducci, R. Heckel, and M. Koch. A fully abstract model for graph-interpreted temporal logic. In Proc. of TAGT'98, pages 310-322. Springer, 2000. LNCS 1764.
13. R. Heckel. Compositional verification of reactive systems specified by graph transformation. In Proc. of FASE'98, pages 138-153. Springer, 1998. LNCS 1382.
14. G.J. Holzmann. The model checker SPIN. IEEE Trans, on Software Engineering, 23(5):279-295, 1997.
15. B. König. A general framework for types in graph rewriting. In Proc. of FST TCS 2000, pages 373-384. Springer, 2000. LNCS 1974.
16. R. Langerak. Transformation and Semantics for LOTOS. PhD thesis, Department of Computer Science, University of Twente, 1992.
17. K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.
18. G.M. Pinna and A. Poigne. On the nature of events: another perspective in concurrency. Theoretical Computer Science, 138(2) :425-454, 1995.
19. rd Workshop on Automated Verification of Critical Systems, Technical Report DSSE-TR2003-2, pages 150-160. University of Southampton, 2003.
20. L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universität Berlin, 1996.
21. D. Varró. Towards symbolic analysis of visual modelling languages. In Proc. GTVMT 2002: International Workshop on Graph Transformation and Visual Modelling Techniques, volume 72.3 of Electronic Notes in Computer Science, pages 57-70. Elsevier, 2002.
22. W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. In Proc. of ICALP'97, pages 538-548. Springer, 1997. LNCS 1256.
23. W. Vogler, A. Semenov, and A. Yakovlev. Unfolding and finite prefix for nets with read arcs. In Proc. of CONCUR'98, pages 501-516. Springer, 1998. LNCS 1466.