Sciweavers

Share
CONCUR
2004
Springer

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

11 years 10 months ago
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.
Paolo Baldan, Andrea Corradini, Barbara König
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where CONCUR
Authors Paolo Baldan, Andrea Corradini, Barbara König
Comments (0)
books