On the Complexity of Verifying Regular Properties on Flat Counter Systems,
Among the approximation methods for the verification of counter systems, one of them consists in model-checking their flat unfoldings. Unfortunately, the complexity characterization of model-checking problems for such operational models is not always well studied except for reachability queries or for Past LTL. In this paper, we characterize the complexity of model-checking problems on flat counter systems for the specification languages including first-order logic, linear mu-calculus, infinite automata, and related formalisms. Our results span different complexity classes (mainly from PTime to PSpace) and they apply to languages in which arithmetical constraints on counter values are systematically allowed. As far as the proof techniques are concerned, we provide a uniform approach that focuses on the main issues.
KeywordsAtomic Formula Counter System Propositional Variable Atomic Proposition Kripke Structure
Unable to display preview. Download preview PDF.
- 1.Boigelot, B.: Symbolic methods for exploring infinite state spaces. PhD thesis, Université de Liège (1998)Google Scholar
- 5.Demri, S., Dhar, A.K., Sangnier, A.: On the complexity of verifying regular properties on flat counter systems (2013), http://arxiv.org/abs/1304.6301
- 13.Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: LICS 2002, pp. 383–392. IEEE (2002)Google Scholar
- 16.Markey, N., Schnoebelen, P.: Mu-calculus path checking. IPL 97(6) (2006)Google Scholar
- 17.Minsky, M.: Computation, Finite and Infinite Machines. Prentice Hall (1967)Google Scholar
- 19.Piterman, N.: Extending temporal logic with ω-automata. Master’s thesis, The Weizmann Institute of Science (2000)Google Scholar
- 22.Stockmeyer, L.J.: The complexity of decision problems in automata and logic. PhD thesis, MIT (1974)Google Scholar
- 23.Vardi, M.: A temporal fixpoint calculus. In: POPL 1988, pp. 250–259. ACM (1988)Google Scholar
- 24.Vardi, M., Wolper, P.: Reasoning about infinite computations. I&C 115 (1994)Google Scholar