Stubborn Sets with Frozen Actions
Most ample, persistent, and stubborn set methods use some special condition for ensuring that the analysis is not terminated prematurely. In the case of stubborn set methods for safety properties, implementation of the condition is usually based on recognizing the terminal strong components of the reduced state space and, if necessary, expanding the stubborn sets used in their roots. In an earlier study it was pointed out that if the system may execute a cycle consisting of only invisible actions and that cycle is concurrent with the rest of the system in a non-obvious way, then the method may be fooled to construct all states of the full parallel composition. This problem is solved in this study by a method that is based on “freezing” the actions in the cycle.
KeywordsPartial-order methods Stubborn sets Safety properties Ignoring problem
We thank the anonymous reviewers for their comments.
- 1.Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking, p. 314. MIT Press, Cambridge (1999)Google Scholar
- 9.Peled, D.: Partial order reduction: linear and branching temporal logics and process algebras. In: Peled, D.A., Pratt, V.R., Holzmann, G.J. (eds.) Partial Order Methods in Verification: DIMACS Workshop. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29, pp. 233–257. American Mathematical Society (1997)Google Scholar
- 12.Valmari, A.: Error detection by reduced reachability graph generation. In: Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, pp. 95–122 (1988)Google Scholar
- 14.Valmari, A.: Stubborn set methods for process algebras. In: Peled, D.A., Pratt, V.R., Holzmann, G.J. (eds.) Partial Order Methods in Verification: DIMACS Workshop. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29, pp. 213–231. American Mathematical Society (1997)Google Scholar
- 16.Valmari, A.: More stubborn set methods for process algebras. In: Gibson-Robinson, T., Hopcroft, P., Lazić, R. (eds.) Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. LNCS, vol. 10160, pp. 246–271. Springer, Cham (2017). doi: 10.1007/978-3-319-51046-0_13 CrossRefGoogle Scholar
- 17.Valmari, A., Hansen, H.: Stubborn set intuition explained. In: Cabac, L., Kristensen, L.M., Rölke, H. (eds.) Proceedings of the International Workshop on Petri Nets and Software Engineering 2016. CEUR Workshop Proceedings, vol. 1591, pp. 213–232 (2016)Google Scholar
- 18.Valmari, A., Hansen, H.: Stubborn set intuition explained. In: Transactions on Petri Nets and Other Models of Concurrency. LNCS (accepted for publication). An extended version of Google Scholar
- 20.Valmari, A., Vogler, W.: Fair testing and stubborn sets (submitted for publication). An extended journal version of Google Scholar