Stubborn Sets for Simple Linear Time Properties
We call a linear time property simple if counterexamples are accepted by a Büchi automaton that has only singleton strongly connected components. This class contains interesting properties such as LTL formulas \(G(\varphi \implies F \psi)\) or ϕU ψ which have not yet received support beyond general LTL preserving approaches.
We contribute a stubborn set approach to simple properties with the following ingredients. First, we decompose the verification problem into finitely many simpler problems that can be independently executed. Second, we propose a stubborn set method for the resulting problems that does neither require cycle detection, nor stuttering invariance, nor existence of transitions that are invisible to all atomic propositions. This means that our approach is applicable in cases where traditional approaches fail. Third, we show that sufficient potential is left in existing implementations of the proposed conditions by exploiting all the available nondeterminism in these procedures. We employ a translation to integer linear programming (ILP) for supporting this claim.
KeywordsModel Check Integer Linear Programming Atomic Proposition Linear Time Temporal Logic Integer Linear Programming Problem
Unable to display preview. Download preview PDF.
- 3.Ciardo, G., et al.: The smart model checker, http://www.cs.ucr.edu/~ciardo/SMART
- 6.Gerth, R., Kuiper, R., Peled, D., Penczek, W.: A partial order approach to branching time logic model checking. In: IEEE 3rd Israel Symp. on the Theory of Computing and Systems, pp. 130–140 (1995)Google Scholar
- 7.Godefroid, P., Wolper, P.: A partial approach to model checking. In: 6th IEEE Symp. on Logic in Computer Science, Amsterdam, pp. 406–415 (1991)Google Scholar
- 9.Kordon, F., et al.: Report on the model checking contest at Petri Nets, LNCS ToPNoC (2011), more information provided on http://sumo.lip6.fr/mcc.html (accepted for publication in January 2012)
- 12.Reisig, W.: Elements Of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer (September 1998)Google Scholar
- 15.Stahl, C., Reisig, W., Krstic, M.: Hazard detection in a GALS wrapper: A case study. In: ACSD 2005, pp. 234–243. IEEE Computer Society (2005)Google Scholar
- 16.Valmari, A.: Error detetction by reduced reachability graph generation. In: 9th European Workshop on Application and Theory of Petri Nets, Venice, Italy, pp. 95–112 (1988)Google Scholar
- 17.Valmari, A.: A stubborn attack on state explosion. In: Formal Methods in System Design 1, pp. 297–322 (1992)Google Scholar
- 18.Valmari, A.: Stubborn set methods for process algebras. In: Workshop on Partial Order Methods in Verification, Princeton, pp. 192–210 (1996)Google Scholar
- 20.Varpaaniemi, K.: On the stubborn set method in reduced state space generation. PhD thesis, Helsinki University of Technology (1998)Google Scholar