A Static Analysis Technique for Graph Transformation Systems
In: Concurrency Theory : Proceedings of the 12th International Conference, CONCUR 2001. - (Lecture Notes in Computer Science ; 2154)
Berlin [u.a.]: Springer (2001), S. 381-395
Buchaufsatz / Kapitel / Fach: Informatik
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.