What Agents Can Probably Enforce

Authors:
Nils Bulling;Wojciech Jamroga
Affiliations:
Department of Informatics, Clausthal University of Technology, Germany. {bulling,wjamroga}@in.tu-clausthal.de;(Correspd.) Department of Informatics, Clausthal University of Technology, Germany. {bulling,wjamroga}@in.tu-clausthal.de
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2009

Citing 3
Cited 0

Alternating-time temporal logic

Journal of the ACM (JACM)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
On the computational power of PP and (+)P

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Alternating-time Temporal Logic (ATL) is probably themost influential logic of strategic ability that has emerged in recent years. The idea of ATL is centered around cooperation modalities: ≪A≫γ is satisfied if the group A of agents has a collective strategy to enforce temporal property γ against the worst possible response from the other agents. So, the semantics of ATL shares the "all-or-nothing" attitude of many logical approaches to computation. Such an assumption seems appropriate in some application areas (life-critical systems, security protocols, expensive ventures like space missions). In many cases, however, one might be satisfied if the goal is achieved with reasonable likelihood. In this paper, we try to soften the rigorous notion of success that underpins ATL.