Verifying Finite-State Graph Grammars: An Unfolding-Based Approach

We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the unfolding semantics and it generalises McMillan’s complete prefix approach, originally developed for Petri nets, to graph transformation systems. It allows to check properties of the graphs reachable in the system, expressed in a monadic second order logic.

• Type: Conference
• Year: 2004
• Where: CONCUR
• Authors: Paolo Baldan, Andrea Corradini, Barbara König
• Keywords: Behavioural Properties, CONCUR 2004, Graph Transformation Systems, McMillan’s Complete Prefix