Alternating-time temporal logic

Journal of the ACM

Volumn 49, Issue 5, 2002, Pages 672-713

  Alur, Rajeev ^a,d   Henzinger, Thomas A ^b,e   Kupferman, Orna ^c,e  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^d UNIVERSITY OF PENNSYLVANIA   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Alternation; Games; Model checking; Temporal logic

Indexed keywords

ALTERNATING-TIME TEMPORAL LOGIC; ALTERNATION; GAMES; MODEL CHECKING; TEMPORAL LOGIC;

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FORMAL LANGUAGES; GAME THEORY; LINEAR SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPEN SYSTEMS; POLYNOMIAL APPROXIMATION;

FORMAL LOGIC;

EID: 0042908709     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/585265.585270     Document Type: Article

References (56)

1. ABADI, M., AND LAMPORT, L. 1995. Conjoining specifications. ACM Trans. Prog. Lang. Syst. 17, 3, 507-534.
2. ABADI, M., LAMPORT, L., AND WOLPER, P. 1989. Realizable and unrealizable concurrent program specifications. In Proc. 16th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 372. Springer-Verlag, 1-17.
3. ALUR, R., DE ALFARO, L., GROSU, R., HENZINGER, T. A., KANG, M., KIRSCH, C. M., MAJUMDAR, R., MANG, F. Y. C., AND WANG, B. Y. 2001. JMOCHA: A model-checking tool that exploits design structure. In Proc. 23rd International Conference on Software Engineering. IEEE Computer Society Press, 835-836.
4. ALUR, R., AND HENZINGER, T. A. 1999. Reactive modules. Formal Methods in System Design 15, 1, 7-48.
5. ALUR, R., HENZINGER, T. A., MANG, F. Y. C., QADEER, S. K., RAJAMANI, S. K., AND TASIRAN, S. 1998. MOCHA: Modularity in model checking. In Proc. 10th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 1427. Springer-Verlag, 521-525.
6. ALUR, R., LA TORRE, S., AND MADHUSUDAN, P. 2002. Playing games with boxes and diamonds. Tech. Rep., Univ. Pennsylvania.
7. BEERI, C. 1980. On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. Datab. Syst. 5, 241-259.
8. BRYANT, R. E. 1992. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24, 3, 293-318.
9. BÜCHI, J. R. AND LANDWEBER, L. H. 1969. Solving sequential conditions by finite-state strategies. Trans. AMS 138, 295-311.
10. 20 states and beyond. Inf. Comput. 98, 2, 142-170.
11. CHANDRA, A. K., KOZEN, D. C., AND STOCKMEYER, L. J. 1981. Alternation. J. ACM 28, 1, 114-133.
12. CLARKE, E. M., AND EMERSON, E. A. 1981. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Proc. Workshop on Logic of Programs. Lecture Notes in Computer Science, vol. 131. Springer-Verlag, 52-71.
13. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Progr. Lang. Syst. 8, 2, 244-263.
14. CLEAVELAND, R., AND STEFFEN, B. 1991. A linear-time model-checking algorithm for the alternation-free modal μ-calculus. In Proc. 3rd International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 575. Springer-Verlag, 48-58.
15. DAM, M. 1994. CTL* and ECTL* as fragments of the modal μ-calculus. Theoret. Comput. Sci. 126, 77-96.
16. DE ALFARO, L., HENZINGER, T. A., AND MAJUMDAR, R. 2001a. From verification to control: Dynamic programs for omega-regular objectives. In Proc. 16th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 279-299.
17. DE ALFARO, L., HENZINGER, T. A., AND MANG, F. Y. C. 2000. The control of synchronous systems. In Proc. 11th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 1877. Springer-Verlag, 458-473.
18. DE ALFARO, L., HENZINGER, T. A., AND MANG, F. Y. C. 2001b. The control of synchronous systems, Part II. In Proc. 12th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 2154. Springer-Verlag, 566-580.
19. DILL, D. L. 1989. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. MIT Press.
20. EMERSON, E. A. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, vol. B. J. van Leeuwen, Ed. Elsevier, 997-1072.
21. EMERSON, E. A., AND HALPERN, J. Y. 1986. Sometimes and not never revisited: On branching versus linear time. J. ACM 33, 1, 151-178.
22. EMERSON, E. A., AND JUTLA, C. 1988. The complexity of tree automata and logics of programs. In Proc. 29th Symp. on Foundations of Computer Science. IEEE Computer Society Press, 328-337.
23. EMERSON, E. A., AND LEI, C.-L. 1985. Modalities for model checking: Branching-time logic strikes back. In Proc. 20th Symp. on Principles of Programming Languages. ACM Press, 84-96.
24. EMERSON, E. A., AND LEI, C.-L. 1986. Efficient model checking in fragments of the propositional μ-calculus. In Proc. 1st Symp. on Logic in Computer Science. IEEE Computer Society Press, 267-278.
25. EMERSON, E. A., AND SISTLA, A. P. 1984. Deciding branching-time logic. In Proc. 16th Symp. on Theory of Computing. ACM Press, 14-24.
26. ETESSAMI, K., WILKE, T., AND SCHULLER, R. A. 2001. Fair simulation relations, parity games, and state space reduction for Büchi automata. In Proc. 28th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 2076. Springer-Verlag, 694-707.
27. FISCHER, M. J., AND LADNER, R. E. 1979. Prepositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 194-211.
28. GAWLICK, R., SEGALA, R., SOGAARD-ANDERSEN, J., AND LYNCH, N. A. 1994. Liveness in timed and untimed systems. In Proc. 21st International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 820. Springer-Verlag, 166-177.
29. GUREVICH, Y., AND HARRINGTON, L. 1982. Trees, automata, and games. In Proc. 14th Symp. on Theory of Computing. ACM Press, 60-65.
30. HALPERN, J. Y. AND FAGIN, R. 1989. Modeling knowledge and action in distributed systems. Distrib. Comput. 3, 4, 159-179.
31. HOARE, C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall.
32. HOLZMANN, G. J. 1997. The model checker SPIN. IEEE Trans. Softw. Eng. 23, 5, 279-295.
33. IMMERMAN, N. 1981. Number of quantifiers is better than number of tape cells. J. Comput. Syst. Sci. 22, 3, 384-406.
34. JURDZINSKI, M. 2000. Small progress measures for solving parity games, In Proc. 17th Symp. on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 1770. Springer-Verlag, 290-301.
35. KOZEN, D. 1983. Results on the prepositional μ-calculus. Theoret. Comput. Sci. 27, 333-354.
36. KUPFERMAN, O., AND VARDI, M. Y. 1995. On the complexity of branching modular model checking. In Proc. 6th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 962. Springer-Verlag, 408-422.
37. KUPFERMAN, O. AND VARDI, M. Y. 1998. Verification of fair transition systems. Chicago J. Theoret. Comput. Sci. 1998, 2.
38. KUPFERMAN, O., VARDI, M. Y., AND WOLPER, P. 2000. An automata-theoretic approach to branching-time model checking. J. ACM 47, 2, 312-360.
39. KUPFERMAN, O., VARDI, M. Y., AND WOLPER, P. 2001. Module checking. Inf. Comput. 164, 322-344.
40. LICHTENSTEIN, O., AND PNUELI, A. 1985. Checking that finite-state concurrent programs satisfy their linear specification. In Proc. 12th Symp. on Principles of Programming Languages. ACM Press, 97-107.
41. LYNCH, N. A. 1996. Distributed Algorithms. Morgan-Kaufmann.
42. MCMILLAN, K. L. 1993. Symbolic Model Checking. Kluwer Academic Publishers.
43. PARIKH, R. 1983. Prepositional game logic. In Proc. 24th Symp. on Foundations of Computer Science. IEEE Computer Society Press, 195-200.
44. PETERSON, G. L., AND REIF, J. H. 1979. Multiple-person alternation. In Proc. 20th Symp. on Foundations of Computer Science. IEEE Computer Society Press, 348-363.
45. PNUELI, A. 1977. The temporal logic of programs. In Proc. 18th Symp. on Foundations of Computer Science. IEEE Computer Society Press, 46-57.
46. PNUELI, A., AND ROSNER, R. 1989a. On the synthesis of a reactive module. In Proc. 16th Symp. on Principles of Programming Languages. ACM Press, 179-190.
47. PNUELI, A., AND ROSNER, R. 1989b. On the synthesis of an asynchronous reactive module. In Proc. 16th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 372. Springer-Verlag, 652-671.
48. PNUELI, A., AND ROSNER, R. 1990. Distributed reactive systems are hard to synthesize. In Proc. 31st Symp. on Foundations of Computer Science. IEEE Computer Society Press, 746-757.
49. QUEILLE, J. P., AND SIFAKIS, J. 1981. Specification and verification of concurrent systems in CESAR. In Proc. 5th International Symp. on Programming. Lecture Notes in Computer Science, vol. 137. Springer-Verlag, 337-351.
50. RABIN, M. O. 1972. Automata on Infinite Objects and Church's Problem. Regional Conference Series in Mathematics, vol. 13., AMS.
51. RAMADGE, P., AND WONHAM, W. 1989. The control of discrete-event systems. IEEE Transactions on Control Theory 77, 81-98.
52. REIF, J. H. 1984. The complexity of two-player games of incomplete information. J. Comput. Syst. Sci. 29, 274-301.
53. ROSNER, R. 1992. Modular synthesis of reactive systems. Ph.D. dissertation, Weizmann Institute of Science, Rehovot, Israel.
54. SHAPLEY, L. S. 1953. Stochastic games. Proc. Nat. Acad. Sci. 39, 1095-1100.
55. THOMAS, W. 1990. Automata on infinite objects. Handbook of Theoretical Computer Science, vol. B. J. van Leeuwen, Ed. Elsevier, 165-191.
56. THOMAS, W. 1995. On the synthesis of strategies in infinite games. In Proc. 12th Symp. on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 900. Springer-Verlag, 1-13.