Data networks (2nd ed.)
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Design/CPN - A Computer Tool for Coloured Petri Nets
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
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
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A Generalised Sweep-Line Method for Safety Properties
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Automatic structure-based code generation from coloured Petri nets: a proof of concept
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
On the computation of stubborn sets of colored petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
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
A perspective on explicit state space exploration of coloured petri nets: past, present, and future
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Catch me if you can – debugging support for model transformations
MODELS'09 Proceedings of the 2009 international conference on Models in Software Engineering
On combining the ready sets with the covering steps methods
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
In this paper, we address the issue of using the stubborn set method for Coloured Petri Nets (CP-nets) without relying on unfolding to the equivalent Place/Transition Net (PT-net). We give a lower bound result stating that there exist CP-nets for which computing "good" stubborn sets requires time proportional to the size of the equivalent PT-net. We suggest an approximative method for computing stubborn set of process-partitioned CP-nets which does not rely on unfolding. The underlying idea is to add some structure to the CP-net, which can be exploited during the stubborn set construction to avoid the unfolding. We demonstrate the practical applicability of the method with both theoretical and experimental case studies, in which reduction of the state space as well as savings in time are obtained.