On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
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 complexity of coalitional resource games
Artificial Intelligence
Model Checking Abilities of Agents: A Closer Look
Theory of Computing Systems
Reasoning about temporal properties of rational play
Annals of Mathematics and Artificial Intelligence
What Agents Can Probably Enforce
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A logic for coalitions with bounded resources
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Resource-bounded alternating-time temporal logic
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Expressing properties of resource-bounded systems: the logics RTL* and RTL
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Expressing properties of resource-bounded systems: the logics RTL* and RTL
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Annals of Mathematics and Artificial Intelligence
On a Logic for Coalitional Games with Priced-Resource Agents
Electronic Notes in Theoretical Computer Science (ENTCS)
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
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.