Abstract
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.
The research of the first author was supported by grants from University of Aarhus Research Foundation and the Danish National Science Research Council.
The research of the second author was a part of the project “Reaktiivisten järjestelmien formaalit menetelmät”, Academy of Finland (29110).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Christensen, J.B. Jørgensen, & L.M. Kristensen: Design/CPN — A Computer Tool for Coloured Petri Nets. Proceedings of the Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 1217, Springer-Verlag, 1997. pp 209–223.
R. Brgan and D. Poitrenuad 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, Lecture Notes in Computer Science 935, Springer-Verlag, 1995. pp 121–140.
D. Bertsekas & R Gallager: Data Networks (2nd Edition) Prentice-Hall, 1992.
P. Godefroid: Using Partial Orders to Improve Automatic Verification Methods. Proceedings of the 2nd Workshop on Computer-Aided Verification, Lecture Notes in Computer Science 531, Springer-Verlag 1991, pp. 175–186.
P. Godefroid: Partial-Order Methods for the Verification of Concurrent Systems, An Approach to the State-Explosion Problem. Lecture Notes in Computer Science 1032, Springer-Verlag 1996, 143 p.
K. Jensen: Coloured Petri Nets — Basic Concepts, Analysis Methods and Practical Use. Vol. 1, Basic Concepts. Monographs in Theoretical Computer Science. Springer-Verlag, 1991.
K. Jensen: Coloured Petri Nets — Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods. Monographs in Theoretical Computer Science. Springer-Verlag, 1994.
D. Peled: All from One, One for All: On Model Checking Using Representatives. Proceedings of CAV’ 93, 5th International Conference on Computer-Aided Verification, Lecture Notes in Computer Science 697, Springer-Verlag 1993, pp. 409–423.
D. Peled: Combining Partial Order Reductions with On-the-fly Model Checking. Formal Methods in System Design 8 1996, pp. 39–64.
J. Toksvig. Design and Implementation of a Place Invariant Tool for Coloured Petri Nets. Master’s thesis, Computer Science Department, University of Aarhus, Denmark, 1995.
A. Valmari: Error Detection by Reduced Reachability Graph Generation. Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, pp. 95–112.
A. Valmari: State Space Generation: Efficiency and Practicality. PhD Thesis, Tampere University of Technology Publications 55, 1988, 169 p.
A. Valmari: Stubborn Sets of Coloured Petri Nets. Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmark 1991, pp. 102–121.
A. Valmari: State of the Art Report: Stubborn Sets. Invited article, Petri Net Newsletter 46, April 1994, pp. 6–14.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kristensen, L.M., Valmari, A. (1998). Finding Stubborn Sets of Coloured Petri Nets without Unfolding. In: Desel, J., Silva, M. (eds) Application and Theory of Petri Nets 1998. ICATPN 1998. Lecture Notes in Computer Science, vol 1420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69108-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-69108-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64677-8
Online ISBN: 978-3-540-69108-2
eBook Packages: Springer Book Archive