Alternating-time temporal logic
The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Abstract
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by the execution of a system; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While linear-time and branching-time logics are natural specification languages for closed systems, alternating-time logics are natural specification languages for open systems. For example, by preceding the temporal operator "eventually" with a selective path quantifier, we can specify that in the game between the system and the environment, the system has a strategy to reach a certain state. The problems of receptiveness, realizability, and controllability can be formulated as model-checking problems for alternating-time formulas. Depending on whether or not we admit arbitrary nesting of selective path quantifiers and temporal operators, we obtain the two alternating-time temporal logics ATL and ATL*.ATL and ATL* are interpreted over concurrent game structures . Every state transition of a concurrent game structure results from a choice of moves, one for each player. The players represent individual components and the environment of an open system. Concurrent game structures can capture various forms of synchronous composition for open systems, and if augmented with fairness constraints, also asynchronous composition. Over structures without fairness constraints, the model-checking complexity of ATL is linear in the size of the game structure and length of the formula, and the symbolic model-checking algorithm for CTL extends with few modifications to ATL. Over structures with weak-fairness constraints, ATL model checking requires the solution of 1-pair Rabin games, and can be done in polynomial time. Over structures with strong-fairness constraints, ATL model checking requires the solution of games with Boolean combinations of Büchi conditions, and can be done in PSPACE. In the case of ATL*, the model-checking problem is closely related to the synthesis problem for linear-time formulas, and requires doubly exponential time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
Automatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
The control of discrete event systems
Ramadge, P. J. G., & Wonham, W. M. (1989) · Proceedings of the IEEE · doi:10.1109/5.21072 · Cited by 2,937
Clarke, E., McMillan, K., Campos, S., & Hartonas-Garmhausen, V. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_93 · Cited by 2,839
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
Shapley, L. S. (1953) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.39.10.1095 · Cited by 2,382
Symbolic Boolean manipulation with ordered binary-decision diagrams
Bryant, R. E. (1992) · ACM Computing Surveys · doi:10.1145/136035.136043 · Cited by 2,015
Results on the propositional μ-calculus
Kozen, D. C. (1983) · Theoretical Computer Science · doi:10.1016/0304-3975(82)90125-6 · Cited by 1,881
On the synthesis of a reactive module
Pnueli, A., & Rosner, R. (1989) · Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 · doi:10.1145/75277.75293 · Cited by 1,432
Communicating Sequential Processes
Hoare, C. A. R. (1978) · Springer eBooks · doi:10.1007/978-1-4757-3472-0_16 · Cited by 1,426
Propositional dynamic logic of regular programs
Fischer, M. J., & Ladner, R. E. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90046-1 · Cited by 1,364
Specification and verification of concurrent systems in CESAR
Queille, J. P., & Sifakis, J. (1982) · Lecture Notes in Computer Science · doi:10.1007/3-540-11494-7_22 · Cited by 1,321
An Automata-Theoretic Approach to Automatic Program Verification
Vardi, M. Y., & Wolper, P. (1986) · ORBi (University of Liège) · Cited by 1,261
Chandra, A. K., Kozen, D. C., & Stockmeyer, L. J. (1981) · Journal of the ACM · doi:10.1145/322234.322243 · Cited by 1,221
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Clarke, E. M., & Emerson, E. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69850-0_12 · Cited by 1,070
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Emerson, E. A., & Halpern, J. Y. (1986) · Journal of the ACM · doi:10.1145/4904.4999 · Cited by 1,009
Checking that finite state concurrent programs satisfy their linear specification
Lichtenstein, O., & Pnueli, A. (1985) · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · doi:10.1145/318593.318622 · Cited by 621
An automata-theoretic approach to branching-time model checking
Kupferman, O., Vardi, M. Y., & Wolper, P. (2000) · Journal of the ACM · doi:10.1145/333979.333987 · Cited by 614
Self-citationAlur, R., & Henzinger, T. A. (1999) · Formal Methods in System Design · doi:10.1023/a:1008739929481 · Cited by 541
Self-citationAutomata-theoretic techniques for modal logics of programs
Vardi, M. Y., & Wolper, P. (1986) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(86)90026-7 · Cited by 522
Abadi, M., & Lamport, L. (1995) · ACM Transactions on Programming Languages and Systems · doi:10.1145/203095.201069 · Cited by 456
Small Progress Measures for Solving Parity Games
Jurdziński, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46541-3_24 · Cited by 421
On the synthesis of an asynchronous reactive module
Pnueli, A., & Rosner, R. (1989) · Lecture notes in computer science · doi:10.1007/bfb0035790 · Cited by 383
MOCHA: Modularity in model checking
Alur, R., Henzinger, T. A., Mang, F. Y. C., Qadeer, S., Rajamani, S. K., & Tasiran, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028774 · Cited by 382
Self-citationHandbook of theoretical computer science
Czerbo, D. B. (1992) · Artificial Intelligence in Medicine · doi:10.1016/0933-3657(92)90044-p · Cited by 338
Realizable and unrealizable specifications of reactive systems
Abadi, M., Lamport, L., & Wolper, P. (1989) · Lecture Notes in Computer Science · doi:10.1007/bfb0035748 · Cited by 244
Specification and Verification of Concurrent Systems
Rattray, C. (1990) · Workshops in computing · doi:10.1007/978-1-4471-3534-0 · Cited by 233
Number of quantifiers is better than number of tape cells
Immerman, N. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90039-8 · Cited by 174
On the menbership problem for functional and multivalued dependencies in relational databases
Beeri, C. (1980) · ACM Transactions on Database Systems · doi:10.1145/320613.320614 · Cited by 169
Peterson, G. L., & Reif, J. H. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.25 · Cited by 167
The Control of Synchronous Systems
de Alfaro, L., Henzinger, T. A., & Mang, F. Y. C. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44618-4_33 · Cited by 40
Self-citationThe Control of Synchronous Systems, Part II
de Alfaro, L., Henzinger, T. A., & Mang, F. Y. C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44685-0_38 · Cited by 26
Self-citation
Cited by
Handbook of Knowledge Representation
(2008) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(07)x0300-6 · Cited by 883
Relling, M. V., Gardner, E. E., Sandborn, W. J., Schmiegelow, K., Pui, C.-H., Yee, S. W., Stein, C. M., Carrillo, M., Evans, W. E., & Klein, T. E. (2011) · Clinical Pharmacology & Therapeutics · doi:10.1038/clpt.2010.320 · Cited by 574
Learning Assumptions for Compositional Verification
Cobleigh, J. M., Giannakopoulou, D., & PĂsĂreanu, C. S. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36577-x_24 · Cited by 399
Computational Aspects of Cooperative Game Theory
Chalkiadakis, G., Elkind, E., & Wooldridge, M. (2012) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01558-8 · Cited by 337
Synthesis of interface specifications for Java classes
Alur, R., Černý, P., Madhusudan, P., & Nam, W. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040314 · Cited by 316
Self-citation
Metadata
- Authors
- Alur, R., Henzinger, T. A., & Kupferman, O.
- Venue
- Journal of the ACM
- Published
- 2002-09
- Volume
- 49
- Issue
- 5
- Pages
- 672-713
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2048905609
- Cited by
- 1,394
- References
- 37
- FWCI
- 31.11
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.