Coloured Petri Nets: a high level language for system design and analysis
APN 90 Proceedings on Advances in Petri nets 1990
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
A symbolic simulation mechanism for well-formed coloured Petri nets
ANSS '92 Proceedings of the 25th annual symposium on Simulation
IEEE Transactions on Parallel and Distributed Systems
Model checking
An improvement in formal verification
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Eliminating Redundant Interleavings During Concurrent Program Verification
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
An Efficient Algorithm for the Computation of Stubborn Sets of Well Formed Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Finding Stubborn Sets of Coloured Petri Nets Without Unfolding
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Pre-and post-gglomerations for LTL model checking
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Syntactical colored petri nets reductions
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Dynamic tasks verification with QUASAR
Ada-Europe'05 Proceedings of the 10th Ada-Europe international conference on Reliable Software Technologies
A high level language for structural relations in well-formed nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
High level petri nets analysis with helena
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Distributed colored Petri net model-checking with CYCLADES
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Hi-index | 0.00 |
Valmari’s Stubborn Sets method is a member of the so-called partial order methods. These techniques are usually based on a selective search algorithm: at each state processed during the search, a stubborn set is calculated and only the enabled transitions of this set are used to generate the successors of the state. The computation of stubborn sets requires to detect dependencies between transitions in terms of conflict and causality. In colored Petri nets these dependencies are difficult to detect because of the color mappings present on the arcs: conflicts and causality connections depend on the structure of the net but also on these mappings. Thus, tools that implement this technique usually unfold the net before exploring the state space, an operation that is often untractable in practice. We present in this work an alternative method which avoids the cost of unfolding the net. To allow this, we use a syntactically restricted class of colored nets. Note that this class still enables wide modeling facilities since it is the one used in our model checker Helena which has been designed to support the verification of software specifications. The algorithm presented has been implemented and several experiments which show the benefits of our approach are reported. For several models we obtain a reduction close or even equal to the one obtained after an unfolding of the net. We were also able to efficiently reduce the state spaces of several models obtained by an automatic translation of concurrent software.