101 search results - page 9 / 21 » On Reachability in Autonomous Continuous Petri Net Systems |
114
click to vote
APN
1999
Springer
15 years 3 months ago
1999
Springer
Discrete event dynamic systems may have extremely large state spaces. For their analysis, it is usual to relax the description by removing the integrality constraints. Applying thi...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
CONCUR
2004
Springer
15 years 3 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...
102
click to vote
CONCUR
2001
Springer
15 years 3 months ago
2001
Springer
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
CONCUR
2000
Springer
15 years 3 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...