Abstract
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.
Supported in part by the NSF grants CCR-9628400 and CCR-9700061, and by a grant from the Intel Corporation. Part of this work was done when this author was a Varon Visiting Professor at the Weizmann Institute of Science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th IEEE Symposium on Foundations of Computer Science, pages 100–109, 1997.
M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73–132, 1993.
M. Antoniotti. Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the Control-D system. PhD thesis, New York University, New York, 1995.
O. Bernholtz, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D. L. Dill, editor, Proc. 6th CAV, LNCS 818, pages 142–155, 1994.
E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, pages 52–71, 1981.
E. M. Clarke, O. Grumberg, and M. C. Browne. Reasoning about networks with many identical finite-state processes. In Proc. 5th PODC, pages 240–248, 1986.
D. L. Dill. Trace theory for automatic hierarchical verification of speed independent circuits. MIT Press, 1989.
E. A. Emerson and C. Jutla. Tree automata, Mu-calculus and determinacy. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, pages 368–377, San Juan, October 1991.
E. A. Emerson and C.-L. Lei. Temporal model checking under generalized fairness constraints. In Proc. 18th Hawaii International Conference on System Sciences, North Holywood, 1985.Western Periodicals Company.
E. A. Emerson. Temporal and modal logic. Handbook of Theoretical Computer Science, pages 997–1072, 1990.
M. J. Fischer and L. D. Zuck. Reasoning about uncertainty in fault-tolerant distributed systems. In M. Joseph, editor, Proc. Symp. on Formal Techniques in Real-Time and FaultTolerant Systems, LNCS 331, pages 142–158, 1988.
O. Grumberg and D. E. Long. Model checking and modular verification. In Proc. 2nd CONCUR, LNCS 527, pages 250–265, 1991.
O. Grumberg and D. E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843–871, 1994.
R. Gawlick, R. Segala, J. Sogaard-Andersen, and N. Lynch. Liveness in timed and untimed systems. In Proc. 21st ICALP, LNCS 820, pages 166–177, 1994.
E. Graedel and I. Walukiewicz. Guarded fixed point logic. In Proc. 14th LICS, 1999.
J. Y. Halpern and R. Fagin. Modelling knowladge and action in distributed systems. Distributed Computing, 3(4):159–179, 1989.
T. A. Henzinger, O. Kupferman, and S. Qadeer. From pre-historic to post-modern symbolic model checking. In Proc. 10th CAV, LNCS 1427, 1998.
D. Harel, O. Kupferman, and M. Y. Vardi. On the complexity of verifying concurrent transition systems. In Proc. 8th CONCUR, LNCS 1243, pages 258–272, 1997. Springer-Verlag.
C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
D. Harel and A. Pnueli. On the development of reactive systems. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 477–498. Springer-Verlag, 1985.
B. Jonsson and Y.-K. Tsay. Assumption/guarantee specifications in linear-time temporal logic. In Proc. TAPSOFT’ 95, LNCS 915, pages 262–276, 1995.
D. Kozen. Results on the propositional π-calculus. Theoretical Computer Science, 27:333–354, 1983.
O. Kupferman and M. Y. Vardi. On the complexity of branchingmodular model checking. In Proc. 6th CONCUR, LNCS 962, pages 408–422, 1995.
O. Kupferman and M. Y. Vardi. Module checking. In Proc. 8th CAV, LNCS 1102, pages 75–86, 1996.
O. Kupferman and M. Y. Vardi. Module checking revisited. In Proc. 9th CAV, LNCS 1254, pages 36–47, 1997.
O. Kupferman and M. Y. Vardi. Weak alternating automata and tree automata emptiness. In Proc. 30th STOC, pages 224–233, 1998.
L. Lamport. Sometimes is sometimes “not never”-on the temporal logic of programs. In Proc. 7th POPL, pages 174–185, 1980.
R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd International Joint Conference on Artificial Intelligence, pages 481–489. British Computer Society, September 1971.
D. E. Muller and P. E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54,:267–276, 1987.
D. E. Muller and P. E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. Theoretical Computer Science, 141:69–107, 1995.
A. Pnueli. In transition from global to modular temporal reasoning about programs. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 123–144. Springer-Verlag, 1985.
A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th POPL, 1989.
J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, LNCS 137, pages 337–351, 1981.
M. O. Rabin. Weakly definable relations and special automata. In Proc. Symp. Math. Logic and Foundations of Set Theory, pages 1–23. North Holland, 1970.
P. J. G. Ramadge and W. M. Wonham. The control of descrete event systems. IEEE Transactions on Control Theory, 77:81–98, 1989.
R. S. Streett and E. A. Emerson. An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation, 81(3):249–264, 1989.
J. W. Thatcher. Tree automata: an informal survey. In A. V. Aho, editor, Currents in the theory of computing, pages 143–172. Prentice-Hall, Englewood Cliffs, 1973.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182–221, April 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kupferman, O., Vardi, M.Y. (1999). Robust Satisfaction. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_27
Download citation
DOI: https://doi.org/10.1007/3-540-48320-9_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66425-3
Online ISBN: 978-3-540-48320-5
eBook Packages: Springer Book Archive