On relative and probabilistic finite counterability

Orna Kupferman, Gal Vardi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


A counterexample to the satisfaction of a linear property ψ in a system S is an infinite computation of S that violates ψ. When ψ is a safety property, a counterexample to its satisfaction need not be infinite. Rather, it is a bad-prefix for ψ: a finite word all whose extensions violate. The existence of finite counterexamples is very helpful in practice. Liveness properties do not have bad-prefixes and thus do not have finite counterexamples. We extend the notion of finite counterexamples to non-safety properties. We study counterable languages - ones that have at least one bad-prefix. Thus, a language is counterable iff it is not liveness. Three natural problems arise: (1) Given a language, decide whether it is counterable, (2) study the length of minimal bad-prefixes for counterable languages, and (3) develop algorithms for detecting bad-prefixes for counterable languages. We solve the problems for languages given by means of LTL formulas or nondeterministic Büchi automata. In particular, our EXPSPACEcompleteness proof for the problem of deciding whether a given LTL formula is counterable, and hence also for deciding liveness, settles a long-standing open problem. In addition, we make finite counterexamples more relevant and helpful by introducing two variants of the traditional definition of bad-prefixes. The first adds a probabilistic component to the definition. There, a prefix is bad if almost all its extensions violate the property. The second makes it relative to the system. There, a prefix is bad if all its extensions in the system violate the property. We also study the combination of the probabilistic and relative variants. Our framework suggests new variants also for safety and liveness languages. We solve the above three problems for the different variants. Interestingly, the probabilistic variant not only increases the chances to return finite counterexamples, but also makes the solution of the three problems exponentially easier.

Original languageAmerican English
Title of host publication24th EACSL Annual Conference on Computer Science Logic, CSL 2015
EditorsStephan Kreutzer
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Number of pages18
ISBN (Electronic)9783939897903
StatePublished - 1 Sep 2015
Event24th EACSL Annual Conference on Computer Science Logic, CSL 2015 - Berlin, Germany
Duration: 7 Sep 201510 Sep 2015

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference24th EACSL Annual Conference on Computer Science Logic, CSL 2015

Bibliographical note

Publisher Copyright:
© Orna Kupferman and Gal Vardi.


  • Counterexamples
  • Liveness
  • Model checking
  • Probability
  • Safety

Cite this