DMCA
Alternating-time Temporal Logic (1997)
Cached
Download Links
| Venue: | Journal of the ACM |
| Citations: | 620 - 53 self |
BibTeX
@INPROCEEDINGS{Alur97alternating-timetemporal,
author = {Rajeev Alur and Thomas Henzinger and Orna Kupferman},
title = {Alternating-time Temporal Logic},
booktitle = {Journal of the ACM},
year = {1997},
pages = {100--109},
publisher = {IEEE Computer Society Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; 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. Also the problems of receptiveness, realizability, and controllability can be formulated as model-checking problems for alternating-time formulas.
Keyphrases
alternating-time temporal logic temporal logic natural specification language certain state closed system possible outcome environment alternate move alternating-time logic open system branching-time temporal logic model-checking problem implicit universal quantification alternating-time formula selective path quantifier temporal operator system move general variety branching-time logic universal quantification linear-time temporal logic
