{"extern":1,"status":"public","_id":"4609","conference":{"name":"FOCS: Foundations of Computer Science"},"year":"1997","type":"conference","month":"01","day":"01","quality_controlled":0,"publisher":"IEEE","title":"Alternating-time temporal logic","abstract":[{"text":"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","lang":"eng"}],"date_updated":"2021-01-12T08:00:28Z","date_published":"1997-01-01T00:00:00Z","page":"100 - 109","publication_status":"published","doi":" 10.1109/SFCS.1997.646098 ","citation":{"ista":"Alur R, Henzinger TA, Kupferman O. 1997. Alternating-time temporal logic. FOCS: Foundations of Computer Science, 100–109.","ama":"Alur R, Henzinger TA, Kupferman O. Alternating-time temporal logic. In: IEEE; 1997:100-109. doi:<a href=\"https://doi.org/ 10.1109/SFCS.1997.646098 \"> 10.1109/SFCS.1997.646098 </a>","apa":"Alur, R., Henzinger, T. A., &#38; Kupferman, O. (1997). Alternating-time temporal logic (pp. 100–109). Presented at the FOCS: Foundations of Computer Science, IEEE. <a href=\"https://doi.org/ 10.1109/SFCS.1997.646098 \">https://doi.org/ 10.1109/SFCS.1997.646098 </a>","chicago":"Alur, Rajeev, Thomas A Henzinger, and Orna Kupferman. “Alternating-Time Temporal Logic,” 100–109. IEEE, 1997. <a href=\"https://doi.org/ 10.1109/SFCS.1997.646098 \">https://doi.org/ 10.1109/SFCS.1997.646098 </a>.","ieee":"R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,” presented at the FOCS: Foundations of Computer Science, 1997, pp. 100–109.","short":"R. Alur, T.A. Henzinger, O. Kupferman, in:, IEEE, 1997, pp. 100–109.","mla":"Alur, Rajeev, et al. <i>Alternating-Time Temporal Logic</i>. IEEE, 1997, pp. 100–09, doi:<a href=\"https://doi.org/ 10.1109/SFCS.1997.646098 \"> 10.1109/SFCS.1997.646098 </a>."},"publist_id":"100","author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Thomas Henzinger"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"date_created":"2018-12-11T12:09:44Z"}