74 search results - page 7 / 15 » Reachability analysis for a class of Petri nets |
APN
2004
Springer
14 years 26 days ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
AUTOMATICA
2011
13 years 2 months ago
2011
Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreove...
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...
ACSD
2006
IEEE
14 years 1 months ago
2006
IEEE
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
APN
2005
Springer
14 years 1 months 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 ...