Advertisement

Stubborn sets for reduced state space generation

  • Antti Valmari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 483)

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.

Keywords

system verification analysis of behaviour of nets 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Aho & 74]
    Aho, A. V., Hopcroft, J. E. & Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974. 470 p.Google Scholar
  2. [Back & 87]
    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.Google Scholar
  3. [Brauer & 87]
    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.Google Scholar
  4. [Brookes & 84]
    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.Google Scholar
  5. [Genrich 87]
    Genrich, H.: Predicate/Transition Nets. In: [Brauer & 87], pp. 207–247.Google Scholar
  6. [Jensen 87]
    Jensen, K.: Coloured Petri Nets. In: [Brauer & 87], pp. 248–299.Google Scholar
  7. [Manna & 81]
    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.Google Scholar
  8. [Overman 81]
    Overman, W. T.: Verification of Concurrent Systems: Function and Timing. Ph.D. Dissertation, University of California Los Angeles 1981. 174 p.Google Scholar
  9. [Pnueli 86]
    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.Google Scholar
  10. [Reisig 85]
    Reisig, W.: Petri Nets, an Introduction. Springer 1985. 161 p.Google Scholar
  11. [Reisig 87]
    Reisig, W.: Place/Transition Systems. In: [Brauer & 87] pp. 117–141.Google Scholar
  12. [Rozenberg & 86]
    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.Google Scholar
  13. [Thiagarajan 87]
    Thiagarajan, P. S.: Elementary Net Systems. In: [Brauer & 87] pp. 26–59.Google Scholar
  14. [Valmari 88a]
    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.Google Scholar
  15. [Valmari 88b]
    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.Google Scholar
  16. [Valmari 88c]
    Valmari, A.: State Space Generation: Efficiency and Practicality. Ph.D. Thesis, Tampere University of Technology Publications 55, Tampere 1988. 169 p.Google Scholar
  17. [Valmari 89a]
    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.Google Scholar
  18. [Valmari 89b]
    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.Google Scholar
  19. [Valmari 90]
    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.Google Scholar
  20. [Wheeler 85]
    Wheeler, G. R.: Numerical Petri Nets — A Definition. Telecom Australia Research Laboratories Report 7780, 1985, 42 p.Google Scholar
  21. [Wheeler & 90]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Antti Valmari
    • 1
  1. 1.Technical Research Centre of FinlandComputer Technology LaboratoryOULUFINLAND

Personalised recommendations