Sciweavers

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

32

CAV
2004
Springer

favoriteEmaildiscussreport

104views Hardware» more CAV 2004»

Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings

14 years 4 months ago

Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings

Download rodin.cs.ncl.ac.uk

Abstract. We present an unfolding-based approach to LTL-X modelchecking of high-level Petri nets. It is based on the method proposed by Esparza and Heljanko for low-level nets [4, 5] and a state of the art parallel high-level net unfolder described in [15, 13]. We present experimental results comparing our approach to the one of [4, 5] and the model-checker Spin [12].

Claus Schröter, Victor Khomenko

Real-time Traffic

CAV 2004 | Formal Methods | Low-level Nets | LTL-X Modelchecking | Unfolding-based Approach |

claim paper

Related Content

» LP Deadlock Checking Using Partial Order Dependencies

» Simulating Algebraic HighLevel Nets by Parallel Attributed Graph Transformation

» Model Checking with Finite Complete Prefixes Is PSPACEComplete

» Verifying FiniteState Graph Grammars An UnfoldingBased Approach

» UnfoldingBased Diagnosis of Systems with an Evolving Topology

» Detection of Illegal Behaviors Based on Unfoldings

» Detecting State Coding Conflicts in STG Unfoldings Using SAT

» Structural Patterns for Soundness of Business Process Models

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	CAV
Authors	Claus Schröter, Victor Khomenko

Comments (0)