Stubborn sets for reduced state space generation

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.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[3]  Wolfgang Reisig,et al.  Place/Transition Systems , 1986, Advances in Petri Nets.

[4]  P. S. Thiagarajan,et al.  Elementary Net Systems , 1986, Advances in Petri Nets.

[5]  Stephen D. Crocker,et al.  Verification of Concurrent Systems: Function and Timing , 1982, PSTV.

[6]  G Wheeler,et al.  Baby TORAS Eats Philosophers But Thinks About Solitaire , 1990 .

[7]  Antti Valmari,et al.  Eliminating Redundant Interleavings During Concurrent Program Verification , 1989, PARLE.

[8]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[9]  Ralph-Johan Back,et al.  Distributed cooperation with action systems , 1988, TOPL.

[10]  李幼升,et al.  Ph , 1989 .

[11]  Alfred V. Aho,et al.  The design and analysis of algorithms , 1974 .

[12]  Grzegorz Rozenberg,et al.  Petri Nets: Basic Notions, Structure, Behaviour , 1986, Current Trends in Concurrency.

[13]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[14]  W. Issel,et al.  Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,– , 1979 .

[15]  Hartmann J. Genrich.  Predicate/transition nets , 1987 .

[16]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[17]  A. Valmari,et al.  Stubborn Sets for Reduced State Space Generation, Proc. 11th Internat. Conf. on Application and Theory of Petri Nets , 1990 .

[18]  Robert S. Boyer,et al.  The Correctness Problem in Computer Science , 1982 .

[19]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[20]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

[21]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, Germany, 8-19 September 1986 , 1987, Advances in Petri Nets.