Stubborn Sets for Standard Properties

Stubborn sets are a tool for state space reduction preserving certain system properties. We present stubborn set approaches for all popular Petri net standard properties. This extends the list of properties that can be analysed successfully (including boundedness, reversibility). For other properties, our approach can lead to larger reductions (reachability) than previous ones. Furthermore, shortest and chepest witness paths for several properties are now preserved.

[1]  Alain Finkel,et al.  The Minimal Coverability Graph for Petri Nets , 1991, Applications and Theory of Petri Nets.

[2]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[3]  Doron A. Peled,et al.  Relaxed Visibility Enhances Partial Order Reduction , 1997, Formal Methods Syst. Des..

[4]  Pierre Wolper,et al.  A Partial Approach to Model Checking , 1994, Inf. Comput..

[5]  Antti Valmari,et al.  On-the-Fly Verification with Stubborn Sets , 1993, CAV.

[6]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[7]  Antti Valmari,et al.  The State Explosion Problem , 1996, Petri Nets.

[8]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[9]  Antti Valmari,et al.  Stubborn sets for reduced state generation , 1991 .

[10]  Grzegorz Rozenberg.  Advances in Petri Nets 1990 , 1989, Lecture Notes in Computer Science.

[11]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[12]  Doron A. Peled,et al.  All from One, One for All: on Model Checking Using Representatives , 1993, CAV.

[13]  Wojciech Penczek,et al.  A partial order approach to branching time logic model checking , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[14]  Antti Valmari,et al.  Stubborn set methods for process algebras , 1997, Partial Order Methods in Verification.