• DocumentCode
    3327576
  • Title

    Alternating-time temporal logic

  • Author

    Alur, Rajeev ; Henzinger, Thomas A. ; Kupferman, Orna

  • Author_Institution
    Dept. of Comput. & Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA
  • fYear
    1997
  • fDate
    20-22 Oct 1997
  • Firstpage
    100
  • Lastpage
    109
  • 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
  • Keywords
    controllability; specification languages; temporal logic; alternating-time temporal logic; controllability; model-checking problems; open systems; outcomes of games; realizability; receptiveness; selective quantification; specification languages; temporal logic; Contracts; Controllability; Costs; Debugging; Engineering profession; Information science; Logic; Open systems; Power system modeling; Specification languages;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on
  • Conference_Location
    Miami Beach, FL
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-8197-7
  • Type

    conf

  • DOI
    10.1109/SFCS.1997.646098
  • Filename
    646098