Alternating-time temporal logic
 | This article needs attention from an expert in Computer science. The specific problem is: contains buzzwords that should be explained in a less technical manner. (July 2017) |
In computer science, alternating-time temporal logic, or ATL, is a branching-time temporal logic that naturally describes computations of multi-agent system and multiplayer games.[1] It offers selective quantification over program-paths that are possible outcomes of games.[2] ATL uses alternating-time formulas to construct model-checkers in order to address problems such as receptiveness, realizability, and controllability.
See also
References
- ^ 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.
{{cite conference}}: Unknown parameter|booktitle=ignored (|book-title=suggested) (help) - ^ "Alternating-time Temporal Logic" by Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104