Sciweavers

9 search results - page 1 / 2
» Parallel LTL-X Model Checking of High-Level Petri Nets Based...
Sort
View
CAV
2004
Springer
104views Hardware» more  CAV 2004»
13 years 10 months ago
Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings
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, ...
Claus Schröter, Victor Khomenko
CONCUR
2000
Springer
13 years 8 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
BIRTHDAY
2005
Springer
13 years 10 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
CONCUR
2000
Springer
13 years 8 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
CONCUR
2004
Springer
13 years 10 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König