We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
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
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.