Formal Verification of Graph Grammars using Mathematical Induction | Zendy

Simone A. Costa | Zendy; Leila Ribeiro | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Formal Verification of Graph Grammars using Mathematical Induction

Author(s) -

Simone A. Costa,

Leila Ribeiro

Publication year - 2009

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.2009.05.044

Subject(s) - computer science , l attributed grammar , rule based machine translation , theoretical computer science , graph rewriting , programming language , graph , context free grammar , artificial intelligence

Graph grammars are a formal description technique suitable for the specification of distributed and reactive systems. Model-checking of graph grammars is currently supported by various approaches. However, in many situations the use of this technique can be very time and space consuming, hindering the verification of properties of many systems. This work proposes a relational and logical approach to graph grammars that allows formal verification of systems using mathematical induction. We use relational structures to define graph grammars and first-order logic to model graph transformations. This approach allows proving properties of systems with infinite state-spaces

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