Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract graphs. In this work, we present a new framework of abstractions unifying and generalising existing takes on abstract graph transformation. The precision of the abstraction can be adjusted according to the properties to be verified facilitating abstraction refinement. We present a modal logic defined on graphs, which is preserved and reflected by our abstractions. Finally, we demonstrate the usability of the framework by verifying a graph transformation model of a firewall.
|Title of host publication||International Conference on Graph Transformations (ICGT)|
|Editors||H Ehrig, R. Heckel, G. Rozenberg, G. Taentzer|
|Place of Publication||Berlin|
|Number of pages||15|
|Publication status||Published - 2008|
|Name||Lecture Notes in Computer Science|
Bauer, J., Boneva, I. B., Kurban, M. E., & Rensink, A. (2008). A Modal-Logic Based Graph Abstraction. In H. Ehrig, R. Heckel, G. Rozenberg, & G. Taentzer (Eds.), International Conference on Graph Transformations (ICGT) (pp. 321-335). [10.1007/978-3-540-87405-8_22] (Lecture Notes in Computer Science; Vol. 5214, No. Supplement). Berlin: Springer. https://doi.org/10.1007/978-3-540-87405-8_22