Verification of Random Graph Transformation Systems | Zendy

Vitali Kozioura | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Verification of Random Graph Transformation Systems

Author(s) -

Vitali Kozioura

Publication year - 2007

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

Subject(s) - counterexample , graph rewriting , computer science , petri net , transformation (genetics) , theoretical computer science , abstraction , graph , model transformation , model checking , software verification , formal verification , algorithm , software system , programming language , software , mathematics , discrete mathematics , artificial intelligence , software construction , biochemistry , chemistry , philosophy , consistency (knowledge bases) , epistemology , gene

In this paper we describe some statistical results obtained by the verification of random graph transformation systems (GTSs). As a verification technique we use over-approximation of GTSs by Petri nets. Properties we want to verify are given by markings of Petri nets. We also use counterexample-guided abstraction refinement approach to refine the obtained approximation. A software tool (Augur) supports the verification procedure. The idea of the paper is to see how many of the generated systems can be successfully verified using this technique

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