Alternating-time Temporal Logic

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

  1. "Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science" by Govert van Drimmelen, IEEE Computer Society Washington, DC, USA
  2. "Alternating-time Temporal Logic" by Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104
This article is issued from Wikipedia - version of the Monday, September 24, 2012. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.