{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article8111","name":"On Relative and Probabilistic Finite Counterability","abstract":"A counterexample to the satisfaction of a linear property psi in a system S is an infinite computation of S that violates psi. Counterexamples are of great help in detecting design errors and in modeling methodologies such as CEGAR. When psi is a safety property, a counterexample to its satisfaction need not be infinite. Rather, it is a bad-prefix for psi: a finite word all whose extensions violate psi. The existence of finite counterexamples is very helpful in practice. Liveness properties do not have bad-prefixes and thus do not have finite counterexamples.\r\n\r\nWe 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\u00fcchi automata. In particular, our EXPSPACE-completeness proof for the problem of deciding whether a given LTL formula is counterable, and hence also for deciding whether it is liveness, settles a long-standing open problem.\r\n\r\nWe also 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 of 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.","keywords":["Model Checking","Counterexamples","Safety","Liveness","Probability","omega-Regular Languages"],"author":[{"@type":"Person","name":"Kupferman, Orna","givenName":"Orna","familyName":"Kupferman"},{"@type":"Person","name":"Vardi, Gal","givenName":"Gal","familyName":"Vardi"}],"position":14,"pageStart":175,"pageEnd":192,"dateCreated":"2015-09-07","datePublished":"2015-09-07","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Kupferman, Orna","givenName":"Orna","familyName":"Kupferman"},{"@type":"Person","name":"Vardi, Gal","givenName":"Gal","familyName":"Vardi"}],"copyrightYear":"2015","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2015.175","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6244","volumeNumber":41,"name":"24th EACSL Annual Conference on Computer Science Logic (CSL 2015)","dateCreated":"2015-09-07","datePublished":"2015-09-07","editor":{"@type":"Person","name":"Kreutzer, Stephan","givenName":"Stephan","familyName":"Kreutzer"},"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article8111","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6244"}}}