Verifying Object-based Graph Grammars

Abstract

The development of concurrent and reactive systems is gaining importance since they are well-suited to modern computing platforms, such as the Internet. However, the development of correct concurrent and reactive systems is a non-trivial task. Object-based graph grammar (OBGG) is a visual formal language suitable for the specification of this class of systems. In previous work, a translation from OBGG to PROMELA (the input language of the SPIN model checker) was defined, enabling the verification of OBGG models using SPIN. In this paper we extend this approach in two different This work is partially sponsored by projects IQ-MObile (CNPqBrazil/CNR-Italy) and PLATUS (CNPq). ways: (1) the approach for property specification is improved, enabling to prove properties not only about possible OBGG derivations, but also about the internal state of involved objects; (2) an approach is defined to interpret PROMELA traces as OBGG derivations, generating graphical counter-examples for properties that are not true for a given OBGG model. Another contribution of this paper is (3) the definition of a method for model checking partial systems (isolated objects or a set of objects) using an assume-guarantee approach. A gas station system modeled with OBGGs is used to illustrate the contributions.

Specification and Analysis of Concurrent Systems Using Object-Based Graph Grammars

“…In [24] a method to allow reasoning about partial models using OBGGs in presented, integrating the model-checling technique discussed above with the assume-guarantee approach for the analysis of partial systems. A methodology adapting the notions of closing a system using stubs and drivers was proposed.…”

The Edge of Graph Transformation — Graphs for Behavioural Specification

“…The main special feature that is needed in this context is the ability to reason about all reachable graphs, usually by exploring and analysing the state space systematically, rather than to efficiently apply a single sequence of rules (possibly with backtracking). Some (relatively) early work exists in the form of CHECKVML [68] and Object-Based Graph Grammars [18], both of which rely on a translation to the standard model checking tool SPIN [38] for the state space exploration. Our own tool GROOVE [58] has a native implementation of this functionality.…”