Abstract
The “stubborn set” theory and method for generating reduced state spaces is presented. The theory takes advantage of concurrency, or more generally, of the lack of interaction between transitions, captured by the notion of stubborn sets. The basic method preserves all terminal states and the existence of nontermination. A more advanced version suited to the analysis of properties of reactive systems is developed. It is shown how the method can be used to detect violations of invariant properties. The method preserves the liveness (in Petri net sense) of transitions, and livelocks which cannot be exited. A modification of the method is given which preserves the language generated by the system. The theory is developed in an abstract variable/transition framework and adapted to elementary Petri nets, place/transition nets with infinite capacity of places, and coloured Petri nets.
The original version of this paper was written while the author was visiting Telecom Australia Research Laboratories, 770 Blackburn Road, Clayton, Victoria 3168, AUSTRALIA.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A. V., Hopcroft, J. E. & Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974. 470 p.
Back, R. J. R. & Kurki-Suonio, R.: Distributed Cooperation with Action Systems. ACM Transactions on Programming Languages and Systems, Vol 10, No. 4 1988, pp. 513–554.
Brauer, W., Reisig, W. & Rozenberg, G. (ed.): Petri Nets: Central Models and Their Properties. Advances in Petri Nets 1986, Part I, Proceedings of an Advanced Course, Bad Honnef, September 1986. Lecture Notes in Computer Science 254, Springer 1987. 480 p.
Brookes, S. D., Hoare, C. A. R. & Roscoe, A. W.: A Theory of Communicating Sequential Processes. Journal of the ACM 31 (3) 1984, pp. 560–599.
Genrich, H.: Predicate/Transition Nets. In: [Brauer & 87], pp. 207–247.
Jensen, K.: Coloured Petri Nets. In: [Brauer & 87], pp. 248–299.
Manna, Z. & Pnueli, A.: The Temporal Framework for Concurrent Programs. In: Boyer, R. S. & Moore, J. S. (ed.): The Correctness Problem in Computer Science. Academic Press 1981, pp. 215–274.
Overman, W. T.: Verification of Concurrent Systems: Function and Timing. Ph.D. Dissertation, University of California Los Angeles 1981. 174 p.
Pnueli, A.: Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends. In: Current Trends in Concurrency, Lecture Notes in Computer Science 224, Springer 1986 pp. 510–584.
Reisig, W.: Petri Nets, an Introduction. Springer 1985. 161 p.
Reisig, W.: Place/Transition Systems. In: [Brauer & 87] pp. 117–141.
Rozenberg, G. & Thiagarajan, P. S.: Petri Nets: Basic Notions, Structure, Behaviour. In: Current Trends in Concurrency, Lecture Notes in Computer Science 224, Springer 1986 pp. 585–668.
Thiagarajan, P. S.: Elementary Net Systems. In: [Brauer & 87] pp. 26–59.
Valmari, A.: Error Detection By Reduced Reachability Graph Generation. Proceedings of the Ninth European Workshop on Application and Theory of Petri Nets, Venice, Italy 1988 pp. 95–112.
Valmari, A.: Heuristics for Lazy State Generation Speeds up Analysis of Concurrent Systems. Proceedings of the Finnish Artificial Intelligence Symposium STeP-88, Helsinki 1988. Volume 2 pp. 640–650.
Valmari, A.: State Space Generation: Efficiency and Practicality. Ph.D. Thesis, Tampere University of Technology Publications 55, Tampere 1988. 169 p.
Valmari, A.: Eliminating Redundant Interleavings during Concurrent Program Verification. Proceedings of Parallel Architectures and Languages Europe '89 Vol. 2, Lecture Notes in Computer Science 366, Springer 1989 pp. 89–103.
Valmari, A.: Stubborn Sets for Reduced State Space Generation. Proceedings of the Tenth International Conference on Application and Theory of Petri Nets, Bonn, West Germany 1989 Vol. 2 pp. 1–22.
Valmari, A.: A Stubborn Attack on State Explosion, 15 p. In: Kurshan, R. & Clarke, E. M. (ed.): Proceedings of the Workshop on Computer-Aided Verification, DIMACS Technical Report 90-31, June 1990, Volume I.
Wheeler, G. R.: Numerical Petri Nets — A Definition. Telecom Australia Research Laboratories Report 7780, 1985, 42 p.
Wheeler, G. R., Valmari, A. & Billington, J.: Baby Toras Eats Philosophers but Thinks about Solitaire. Proceedings of the Fifth Australian Software Engineering Conference, Sydney, NSW, Australia, 1990 pp. 283–288.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valmari, A. (1991). Stubborn sets for reduced state space generation. In: Rozenberg, G. (eds) Advances in Petri Nets 1990. ICATPN 1989. Lecture Notes in Computer Science, vol 483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53863-1_36
Download citation
DOI: https://doi.org/10.1007/3-540-53863-1_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53863-9
Online ISBN: 978-3-540-46369-6
eBook Packages: Springer Book Archive