Robust satisfaction

Orna Kupferman, Moshe Y. Vardi

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

24 Scopus citations


In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general setting, the environment is another open system. Given an open system M and a property ψ we say that M robustly satisfies ψ iff for every open system M ′ which serves as an environment to M, the composition M∥M ′ satisfies ψ The problem of robust model checking is then to decide, given M and ψ whether M robustly satisfies ψ In this paper we study the robust-model-checking problem. We consider systems modeled by nondeterministic Moore machines, and properties specified by branching temporal logic (for linear temporal logic, robust satisfaction coincides with usual satisfaction). We show that the complexity of the problem is EXPTIME-complete for CTL and the μ-calculus, and is 2EXPTIME-complete for CTL*. We partition branching temporal logic formulas into three classes: universal, existential, and mixed formulas. We show that each class has different sensitivity to the robustness requirement. In particular, unless the formula is mixed, robust model checking can ignore nondeterministic environments. In addition, we show that the problem of classifying a CTL formula into these classes is EXPTIME-complete.

Original languageAmerican English
Title of host publicationCONCUR 1999, Concurrency Theory - 10th International Conference, Proceedings
PublisherSpringer Verlag
Number of pages16
ISBN (Print)3540664254, 9783540664253
StatePublished - 1999
Event10th International Conference on Concurrency Theory, CONCUR 1999 - Eindhoven, Netherlands
Duration: 24 Aug 199927 Aug 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1664 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th International Conference on Concurrency Theory, CONCUR 1999


Dive into the research topics of 'Robust satisfaction'. Together they form a unique fingerprint.

Cite this