27 search results - page 4 / 6 » Reachability Problems and Abstract State Spaces for Time Pet... |
ACSD
2004
IEEE
13 years 11 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
CAV
2010
Springer
13 years 10 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
CONCUR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
APN
2005
Springer
14 years 29 days ago
2005
Springer
This paper presents the high level Petri nets analyzer Helena. Helena can be used for the on-the-fly verification of state properties, i.e., properties that must hold in all the ...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
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...