On the (Un-)Decidability of Model Checking Resource-Bounded Agents

The verification and modelling of multi-agent systems is an important topic that has attracted much attention in recent years. Resources, however, have only recently been studied as simple extensions to well-known logics. Trying to find a set of useful features while retaining essential properties for practical use, we explore the question: Where are the limits of what can be verified about resource-bounded agents? We try to answer this question by considering several natural logic-based settings that may arise and prove that verification is usually undecidable apart from bounded or otherwise restrictive settings. Most interestingly, we identify various factors that influence the (un-)decidability and provide grounds for future research on more promising constraints leading to decidable fragments.

[1]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[2]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[3]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[4]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

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

[6]  Michael Wooldridge,et al.  On the computational complexity of coalitional resource games , 2006, Artif. Intell..

[7]  Jürgen Dix,et al.  Model Checking Abilities of Agents: A Closer Look , 2008, Theory of Computing Systems.

[8]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic , 2008, 25 Years of Model Checking.

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

[10]  Wojciech Jamroga,et al.  What Agents Can Probably Enforce , 2009, Fundam. Informaticae.

[11]  Abdur Rakib,et al.  Expressing Properties of Coalitional Ability under Resource Bounds , 2009, LORI.

[12]  Berndt Farwer,et al.  Expressing Properties of Resource-Bounded Systems: The Logics RTL* and RTL , 2009, CLIMA.

[13]  B. Logan,et al.  Verifying Properties of Coalitional Ability under Resource Bounds , 2009 .

[14]  Jürgen Dix,et al.  Reasoning about temporal properties of rational play , 2008, Annals of Mathematics and Artificial Intelligence.

[15]  Abdur Rakib,et al.  A Logic for Coalitions with Bounded Resources , 2009, IJCAI.

[16]  Abdur Rakib,et al.  Resource-bounded alternating-time temporal logic , 2010, AAMAS.