A static analysis technique for graph transformation systems

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

Volumn 2154, Issue , 2001, Pages 381-395

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

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; PHILOSOPHICAL ASPECTS; STATIC ANALYSIS;

ANALYSIS TECHNIQUES; DINING PHILOSOPHERS SYSTEM; FINITE STRUCTURES; GRAPH TRANSFORMATION SYSTEM; HYPERGRAPH; INFINITE STATE; ORIGINAL SYSTEMS; REACHABLE-GRAPH;

GRAPH THEORY;

EID: 84944059317     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44685-0_26     Document Type: Article

References (19)

1. P. Baldan. Modelling concurrent computations: from contextual Petri nets to graph grammars. PhD thesis, Department of Computer Science, University of Pisa, 2000. Available as technical report n. TD-1/00.
2. P. Baldan, A. Corradini, and U. Montanari. Unfolding and Event Structure Semantics for Graph Grammars. In W. Thomas, editor, Proceedings of FoSSaCS’99, volume 1578 of LNCS, pages 73-89. Springer Verlag, 1999.
3. A. Corradini. Concurrent Graph and Term Graph Rewriting. In U. Montanari and V. Sassone, editors, Proceedings CONCUR’96, volume 1119 of LNCS, pages 438-464. Springer Verlag, 1996.
4. H. Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Proceedings 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.
5. H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools. World Scientific, 1999.
6. 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.
7. J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575-591, 1991.
8. J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2-3):151-195, 1994.
9. J. Esparza, S. Romer, and W. Vogler. An improvement of McMillan’s unfolding algorithm. In T. Margaria and B. Steffen, editors, Proc. of TACAS’96, volume 1055 of LNCS, pages 87-106. Springer-Verlag, 1966.
10. T. Genet. Decidable approximations of sets of descendants and sets of normal forms. In T. Nipkow, editor, Proceedings 9th International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 151-165. Springer Verlag, 1998.
11. M. Koch. Integration of Graph Transformation and Temporal Logic for the Specification of Distributed Systems. PhD thesis, Technische Universit¨at Berlin, 2000.
12. B. Konig. A general framework for types in graph rewriting. In Proc. of FST TCS 2000, volume 1974 of LNCS, pages 373-384. Springer-Verlag, 2000.
13. K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.
14. J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105-155, 1990.
15. M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, 13:85-108, 1981.
16. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
17. L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universit¨at Berlin, 1996.
18. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, 1997.
19. W. Vogler, A. Semenov, and A. Yakovlev. Unfolding and finite prefix for nets with read arcs. In Proceedings of CONCUR’98, volume 1466 of LNCS, pages 501-516. Springer-Verlag, 1998.