2002 · 315 citations · 23 references
ComputingComputer ScienceFormal MethodsGame TheoryLogicModel CheckingTemporal LogicBranching Temporal LogicBranching TimeBranching-time LogicBranching-time Temporal LogicLinear Temporal LogicLinear-time Temporal LogicTemporal Logic SpecificationTemporal Operators
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.
23
The temporal logic of programs
Amir Pnueli · 1977 · 5.7K citations
Gerard J. Holzmann · IEEE Transactions on Software Engineering · 1997 · 3.8K citations
The control of discrete event systems
Peter J. Ramadge, W.M. Wonham · Proceedings of the IEEE · 1989 · 2.9K citations
C. T. Bhunia · IETE Journal of Education · 1997 · 2.7K citations