Graph Abstraction and Abstract Graph Transformation
Iovka Boneva, Arend Rensink, Marcos E. Kurbán, Johannes Bauer · University of Twente Research Information · 2007
Abstract Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation of states of these systems, where transitions can be conveniently described by graph transformation rules. We present a framework for the abstraction of graphs supporting abstract graph transformation. The abstrac-tion method naturally generalises previous approaches to abstract graph transformation. The set of possible abstract graphs is finite. This has the pleasant consequence of generating a finite transition system for any start graph and any finite set of transformation rules. Moreover, abstraction preserves a simple logic for ex-pressing properties on graph nodes. The precision of the abstraction can be adjusted according to properties