Towards reachability trees for high-level Petri nets
Advances in Petri Nets 1984
Invariants and paradigms of concurrency theory
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume II: parallel languages: volume II: parallel languages
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Reachability analysis of Petri nets using symmetries
Systems Analysis Modelling Simulation
Theoretical Computer Science
Information and Computation
How to calculate symmetries of Petri nets
Acta Informatica
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Invariant Semantics of Nets with Inhibitor Arcs
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
In many well-known extensions of place-transition nets, including read arcs, inhibitory arcs, reset arcs, priorities and signal arcs, it is sometimes possible to reach a marking through firing a step of transitions which cannot be reached through firing a sequence of single transitions. For state space analysis, it is thus recommendable to consider, in each state, all steps of transitions for firing. Since the number of activated steps may be exponential in the number of transitions, we have, in addition to the well-known state explosion problem, another explosion which we call step explosion. In this paper, we present an approach for alleviating step explosion. We furthermore discuss the joint application of our method with partial order reduction and in the context of CTL model checking.