TY - GEN

T1 - Robust satisfaction

AU - Kupferman, Orna

AU - Vardi, Moshe Y.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84888255277&partnerID=8YFLogxK

U2 - 10.1007/3-540-48320-9_27

DO - 10.1007/3-540-48320-9_27

M3 - Conference contribution

AN - SCOPUS:84888255277

SN - 3540664254

SN - 9783540664253

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 383

EP - 398

BT - CONCUR 1999, Concurrency Theory - 10th International Conference, Proceedings

PB - Springer Verlag

T2 - 10th International Conference on Concurrency Theory, CONCUR 1999

Y2 - 24 August 1999 through 27 August 1999

ER -