Alternating-time temporal logic

In computer science, alternating-time temporal logic, or ATL, is a branching-time temporal logic that extends CTL to multiple players.[1] ATL naturally describes computations of multi-agent systems and multiplayer games.[2] Quantification in ATL is over program-paths that are possible outcomes of games.[3] ATL uses alternating-time formulas to construct model-checkers in order to address problems such as receptiveness, realizability, and controllability.

See also

References

  1. ↑ Alur, Rajeev; Henzinger, Thomas A.; Kupferman, Orna (1997). "Alternating-time temporal logic". Proceedings of the 38th Annual Symposium on Foundations of Computer Science. IEEE Computer Society. pp. 100–109. doi:10.1109/SFCS.1997.646098. ISBN 0-8186-8197-7.
  2. ↑ van Drimmelen, Govert (2003). "Satisfiability in Alternating-time Temporal Logic". Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society. doi:10.1109/LICS.2003.1210060. ISBN 0-7695-1884-2.
  3. ↑ Alur, Rajeev; Henzinger, Thomas A.; Kupferman, Orna (2002). "Alternating-Time Temporal Logic". Journal of the ACM. 49 (5): 672–713. doi:10.1145/585265.585270.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.