Abstract. Graph transformation systems are a general specification language for systems with dynamically changing topologies, such as mobile and distributed systems. We propose a counterexample-guided abstraction refinement technique which is based on the over-approximation of graph transformation systems (gts) by Petri nets. We show that a spurious counterexample is caused by merging nodes during the approximation. We present a technique for identifying these merged nodes and splitting them using abstraction refinement, which removes the spurious run. The technique has been implemented in the Augur tool and experimental results are discussed.
We describe an approach for the verification of attributed graph transformation systems (AGTS). AGTSs are graph transformation systems where graphs are labelled over an algebra. We base our verification procedure on so-called approximated unfoldings combined with counterexample-guided abstraction refinement. Both techniques were originally developed for non-attributed systems. With respect to refinement we focus especially on detecting whether the spurious counterexample is caused by structural over-approximation or by an abstraction of the attributes which is too coarse. The technique is implemented in the verification tool Augur 2 and a leader election protocol has been successfully verified.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.