Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CONCUR
2004
Springer

favoriteEmaildiscussreport

128views Distributed And Parallel Com...» more CONCUR 2004»

Verifying Finite-State Graph Grammars: An Unfolding-Based Approach

13 years 10 months ago

Verifying Finite-State Graph Grammars: An Unfolding-Based Approach

Download www.fmi.uni-stuttgart.de

We propose a framework where behavioural properties of ﬁnite-state systems modelled as graph transformation systems can be expressed and veriﬁed. The technique is based on the unfolding semantics and it generalises McMillan’s complete preﬁx approach, originally developed for Petri nets, to graph transformation systems. It allows to check properties of the graphs reachable in the system, expressed in a monadic second order logic.

Paolo Baldan, Andrea Corradini, Barbara König

Real-time Traffic

Behavioural Properties | CONCUR 2004 | Graph Transformation Systems | McMillan’s Complete Preﬁx |

claim paper

Related Content

» Program Behavior Discovery and Verification A Graph Grammar Approach

» Interface Grammars for Modular Software Model Checking

» Resource Usage Verification

» Conservative Ambiguity Detection in ContextFree Grammars

» Abstraction Techniques for Validation Coverage Analysis and Test Generation

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	CONCUR
Authors	Paolo Baldan, Andrea Corradini, Barbara König

Comments (0)