Pattern-Based Graph Abstraction


Share/Save/Bookmark

Rensink, Arend and Zambon, Eduardo (2012) Pattern-Based Graph Abstraction. In: International Conference on Graph Transformation, ICGT 2012, 24-29 September 2012, Bremen, Germany (pp. pp. 66-80).

[img] PDF
Restricted to UT campus only
: Request a copy
347kB
Abstract:We present a new abstraction technique for the exploration of graph transformation systems with infinite state spaces. This technique is based on patterns, simple graphs describing structures of interest that should be preserved by the abstraction. Patterns are collected into pattern graphs, layered graphs that capture the hierarchical composition of smaller patterns into larger ones. Pattern graphs are then abstracted to a finite universe of pattern shapes by collapsing equivalent patterns. This paper shows how the application of production rules can be lifted to pattern shapes, resulting in an over-approximation of the original system behaviour and thus enabling verification on the abstract level.
Item Type:Conference or Workshop Item
Additional information:Winner of the EATCS Award for Best Paper of ICGT 2012
Copyright:© 2012 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/82080
Official URL:http://dx.doi.org/10.1007/978-3-642-33654-6_5
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page