Abstract
We present two new question-guided stubborn set methods for state properties. The first method makes it possible to determine whether a marking is reachable in which a given state property holds. It generalises the results on stubborn sets for state properties recently suggested by Schmidt in the sense that his method can be seen as an implementation of our more general method. We propose also alternative, more powerful implementations that have the potential of leading to better reduction results. This potential is demonstrated on some practical case studies. As an extension of the first method, we present a second method which makes it possible to determine if from all reachable markings it is possible to reach a marking where a given state property holds. The novelty of this method is that it does not rely on ensuring that no transition is ignored in the reduced state space. Again, the benefit is in the potential for better reduction results.
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.
Similar content being viewed by others
References
S. Christensen, J. B. Jørgensen, and L. M. Kristensen. Design/CPN — A Computer Tool for Coloured Petri Nets. In Proceedings of TACAS’97, volume 1217 of Lecture Notes in Computer Science, pages 209–223. Springer-Verlag, 1997.
A. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.
P. Godefroid. Using Partial Orders to Improve Automatic Verification Methods. In Proceedings of Computer-Aided Verification’ 90, volume 531 of Lecture Notes in Computer Science, pages 175–186. Springer-Verlag, 1990.
P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems, An Approach to the State-Explosion Problem, volume 1032 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
D. Peled. All from One, One for All: On Model Checking Using Representatives. In Proceedings of Computer-Aided Verification’ 93, volume 697 of Lecture Notes in Computer Science, pages 409–423. Springer-Verlag, 1993.
K. Schmidt. Stubborn Sets for Standard Properties. In Proceedings of ICATPN’99, volume 1639 of Lecture Notes in Computer Science, pages 46–65. Springer-Verlag, 1999.
A. Valmari. Error Detection by Reduced Reachability Graph Generation. In Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, pages 95–112, 1988.
A. Valmari. A Stubborn Attack on State Explosion. In Proceedings of Computer-Aided Verification’ 90, volume 531 of Lecture Notes in Computer Science, pages 156–165. Springer-Verlag, 1990.
A. Valmari. Stubborn Sets for Reduced State Space Generation. In G. Rozenberg, editor, Advances in Petri Nets’ 90, volume 483 of Lecture Notes in Computer Science, pages 491–515. Springer-Verlag, 1990.
A. Valmari. The State Explosion Problem. In W. Reisig and G. Rozenberg, editors, Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science, pages 429–528. Springer-Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kristensen, L.M., Valmari, A. (2000). Improved Question-Guided Stubborn Set Methods for State Properties. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-44988-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67693-5
Online ISBN: 978-3-540-44988-1
eBook Packages: Springer Book Archive