Summary: Alternatingtime Temporal Logic ?
Rajeev Alur 1 and Thomas A. Henzinger 2 and Orna Kupferman 2
1 Department of Computer and Information Science,
University of Pennsylvania, Philadelphia, PA 19104,
and Computing Science Research Center, Bell Laboratories, Murray Hill, NJ 07974.
Email: email@example.com. URL: www.cis.upenn.edu/~alur.
2 Department of Electrical Engineering and Computer Sciences,
University of California, Berkeley, CA 94720.
Email: ftah,firstname.lastname@example.org. URL: www.eecs.berkeley.edu/~ftah,ornag.
Abstract Temporal logic comes in two varieties: lineartime temporal logic assumes
implicit universal quantification over all paths that are generated by system moves;
branchingtime 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 al
ternate moves. While lineartime and branchingtime logics are natural specification
languages for closed systems, alternatingtime 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