Abstract
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produces a finite structure consisting of a hypergraph decorated with transitions (Petri graph) which can be seen as an approximation of the Winskel style unfolding of the graph transformation system. The fact that any reachable graph has an homomorphic image in the Petri graph and the additional causal information provided by transitions allow us to prove several interesting properties of the original system. As an application of the proposed technique we show how it can be used to verify the absence of deadlocks in an infinite-state Dining Philosophers system.
Research partially supported by the EC TMR Network GETGRATS, by the ESPRIT Working Group APPLIGRAPH, and by the MURST project TOSCA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.
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.
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.
J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575–591, 1991.
J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2–3):151–195, 1994.
J. Esparza, S. RΩer, 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.
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.
M. Koch. Integration of Graph Transformation and Temporal Logic for the Specification of Distributed Systems. PhD thesis, Technische Universität Berlin, 2000.
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.
K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.
J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105–155, 1990.
M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, 13:85–108, 1981.
W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universität Berlin, 1996.
G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, 1997.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldan, P., Corradini, A., König, B. (2001). A Static Analysis Technique for Graph Transformation Systems. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-44685-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42497-0
Online ISBN: 978-3-540-44685-9
eBook Packages: Springer Book Archive