Verifying a Behavioural Logic for Graph Transformation Systems | Zendy

Paolo Baldan | Zendy; Andrea Corradini | Zendy; Barbara König | Zendy; Bernhard König | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Verifying a Behavioural Logic for Graph Transformation Systems

Author(s) -

Paolo Baldan,

Andrea Corradini,

Barbara König,

Bernhard König

Publication year - 2004

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.08.018

Subject(s) - graph rewriting , graph , transformation (genetics) , theoretical computer science , mathematics , computer science , graph property , algorithm , voltage graph , line graph , biochemistry , chemistry , gene

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 mu-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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research