What Agents Can Probably Enforce

Issue title: Concurrency Specification and Programming (CS&P)

Article type: Research Article

Authors: Bulling, Nils | Jamroga, Wojciech

Affiliations: Department of Informatics, Clausthal University of Technology, Germany. {bulling,wjamroga}@in.tu-clausthal.de

Note: [] Address for correspondence: Department of Informatics, Clausthal University of Technology, Germany

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.

DOI: 10.3233/FI-2009-0089

Journal: Fundamenta Informaticae, vol. 93, no. 1-3, pp. 81-96, 2009