Approximating the behaviour of graph transformation systems

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

Volumn 2505, Issue , 2002, Pages 14-29

  Baldan, Paolo ^a   König, Barbara ^b  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL LANGUAGES; TEMPORAL LOGIC;

ABSTRACT INTERPRETATIONS; ARBITRARY ACCURACY; CLASSICAL APPROACH; FINITE STRUCTURES; GRAPH TRANSFORMATION SYSTEM; LIVENESS PROPERTIES; MODAL MU CALCULUS; UNDER-APPROXIMATION;

GRAPH THEORY;

EID: 84937208016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45832-8_4     Document Type: Conference Paper

References (29)

1. P. Baldan, A. Corradini, and B. König. A static analysis technique for graph transformation systems. In Proc. of CONCUR’01, pages 381–395. Springer-Verlag, 2001. LNCS 2154.
2. P. Baldan, A. Corradini, and B. König. Static analysis of distributed systems with mobility specified by graph grammars—a case study. In Proc. of IDPT’02 (World Conference on Integrated Design & Process Technology), 2002. to appear.
3. P. Baldan, A. Corradini, and U. Montanari. Concatenable graph processes: relating processes and derivation traces. In Proc. of ICALP’98, volume 1443 of LNCS, pages 283–295. Springer Verlag, 1998.
4. P. Baldan, A. Corradini, and U. Montanari. Unfolding and Event Structure Semantics for Graph Grammars. In W. Thomas, editor, Proc. of FoSSaCS’99, volume 1578 of LNCS, pages 73–89. Springer Verlag, 1999.
5. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26:241–265, 1996.
6. 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, chapter 5. World Scientific, 1997.
7. P. Cousot. Abstract interpretation. ACM Computing Surveys, 28(2), 1996.
8. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Formal Models and Semantics, Handbook of Theoretical Computer Science, volume B, pages 243–320. Elsevier, 1990.
9. H. Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Proc. of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of LNCS, pages 1–69. Springer Verlag, 1979.
10. H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.3: Concurrency, Parallellism, and Distribution. World Scientific, 1999.
11. H. Ehrig, J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 2: Concurrency, Parallelism and Distribution. World Scientific, 1999.
12. J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2–3):151–195, 1994.
13. J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.
14. T. Genet. Decidable approximations of sets of descendants and sets of normal forms. In T. Nipkow, editor, Proc. of 9th International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 151–165. Springer Verlag, 1998.
15. R.R. Howell, L.E. Rosier, and H.-C. Yen. A taxonomy of fairness and temporal logic problems for Petri nets. Theoretical Computer Science, 82:341–372, 1991.
16. P. Jancar. Decidability of a temporal logic problem for Petri nets. Theoretical Computer Science, 74:71–93, 1990.
17. N.D. Jones and F. Nielson. Abstract interpretation: a semantics-based tool for program analysis. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Vol. 4: Semantic Modelling, pages 527–636. Oxford University Press, 1995.
18. M. Koch. Integration of Graph Transformation and Temporal Logic for the Specification of Distributed Systems. PhD thesis, Technische Universit¨at Berlin, 2000.
19. B. König. A general framework for types in graph rewriting. In Proc. of FST TCS 2000, volume 1974 of LNCS, pages 373–384. Springer-Verlag, 2000.
20. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:1–35, 1995.
21. P. Manolios and R.J. Trefler. Safety and liveness in branching time. In Proc. of LICS’01, 2001.
22. K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.
23. J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105–155, 1990.
24. A. Prasad Sistla. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing, 6(5):495–512, 1994.
25. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
26. L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universit¨at Berlin, 1996.
27. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations. World Scientific, 1997.
28. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation. Volume 1: Foundations. World Scientific, 1997.
29. V. Sassone. On the Semantics of Petri Nets: Processes, Unfolding and Infinite Computations. PhD thesis, University of Pisa - Department of Computer Science, 1994.