A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Verifying a Behavioural Logic for Graph Transformation Systems
2004
Electronical Notes in Theoretical Computer Science
We propose a framework for the verification of behavioural properties of systems modelled as graph transformation systems. The properties can be expressed in a temporal logic which is basically a µ-calculus where the state predicates are formulae of a monadic second order logic, describing graph properties. The verification technique relies on an algorithm for the construction of finite over-approximations of the unfolding of a graph transformation system. Approximating the Behaviour of GTSs. A
doi:10.1016/j.entcs.2004.08.018
fatcat:q25djbt4ozfpjgj4ac7svx3zwa