Reasoning about memoryless strategies under partial observability and unconditional fairness constraints

Alternating-time Temporal Logic is a logic to reason about strategies that agents can adopt to achieve a specified collective goal.A number of extensions for this logic exist; some of them combine strategies and partial observability, some others include fairness constraints, but to the best of our knowledge no work provides a unified framework for strategies, partial observability and fairness constraints. Integration of these three concepts is important when reasoning about the capabilities of agents without full knowledge of a system, for instance when the agents can assume that the environment behaves in a fair way.We present ATLK irF , a logic combining strategies under partial observability in a system with fairness constraints on states. We introduce a model-checking algorithm for ATLK irF by extending the algorithm for a full-observability variant of the logic and we investigate its complexity. We validate our proposal with an experimental evaluation.

[1]  Wojciech Jamroga,et al.  Agents that Know How to Play , 2004, Fundam. Informaticae.

[2]  Wojciech Jamroga,et al.  Reasoning about strategies of multi-agent programs , 2010, AAMAS.

[3]  Xiaowei Huang,et al.  Symbolic Model Checking Epistemic Strategy Logic , 2014, AAAI.

[4]  Alessio Lomuscio,et al.  MCMAS: A Model Checker for the Verification of Multi-Agent Systems , 2009, CAV.

[5]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[6]  Wojciech Penczek,et al.  Symbolic model checking for temporal-epistemic logics , 2007, SIGA.

[7]  Michael Wooldridge,et al.  Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications , 2003, Stud Logica.

[8]  Ferucio Laurentiu Tiplea,et al.  Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable , 2011, ArXiv.

[9]  Wojciech Jamroga,et al.  Synthesis and Verification of Uniform Strategies for Multi-agent Systems , 2014, CLIMA.

[10]  Krzysztof R. Apt,et al.  Lectures in Game Theory for Computer Scientists , 2011 .

[11]  Lindsay Groves,et al.  Formal Methods and Software Engineering , 2014, Lecture Notes in Computer Science.

[12]  Wojciech Jamroga,et al.  Constructive knowledge: what agents can achieve under imperfect information , 2007, J. Appl. Non Class. Logics.

[13]  Christel Baier,et al.  Principles of model checking , 2008 .

[14]  Nicolas Markey,et al.  On the Expressiveness and Complexity of ATL , 2007, FoSSaCS.

[15]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.

[16]  Charles Pecheur,et al.  Improving the Model Checking of Strategies under Partial Observability and Fairness Constraints , 2014, ICFEM.

[17]  Wojciech Jamroga,et al.  Comparing Variants of Strategic Ability , 2011, IJCAI.

[18]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[19]  Holger Schlingloff,et al.  Finding Uniform Strategies for Multi-agent Systems , 2010, CLIMA.

[20]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[21]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[22]  Jürgen Dix,et al.  Model Checking Abilities under Incomplete Information Is Indeed Delta2-complete , 2006, EUMAS.

[23]  Charles Pecheur,et al.  PyNuSMV: NuSMV as a Python Library , 2013, NASA Formal Methods.

[24]  Pierre-Yves Schobbens,et al.  Alternating-time logic with imperfect recall , 2004, LCMAS.

[25]  Christel Baier,et al.  Alternating-Time Stream Logic for Multi-agent Systems , 2008, COORDINATION.

[26]  Erich Grädel.  Positional Determinacy of Infinite Games , 2004, STACS.