Verifying Systems of Resource-Bounded Agents

  title={Verifying Systems of Resource-Bounded Agents},
  author={Natasha Alechina and Brian S. Logan},
Approaches to the verification of multi-agent systems are typically based on games or transition systems defined in terms of states and actions. However such approaches often ignore a key aspect of multi-agent systems, namely that the agents’ actions require (and sometimes produce) resources. We briefly survey previous work on the verification of multi-agent systems that takes resources into account, and outline some key challenges for future work. 
State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
This work surveys previous work on the verification of multi-agent systems that takes resources into account, extending substantially a survey from 2016.


MCMAS: A Model Checker for the Verification of Multi-Agent Systems
While temporal logic in its various forms has proven essential to reason about reactive systems, agent-based scenarios are typically specified by considering high-level agents attitudes. In
Verifying Multi-agent Programs by Model Checking
This paper automatically translates multi-agent systems programmed in the logic-based agent-oriented programming language AgentSpeak into either Promela or Java, and then uses the associated Spin and JPF model checkers to verify the resulting systems.
The cognitive agents specification language and verification environment for multiagent systems
This paper describes CASL and a verification environment (CASLve) for it based on the PVS verification system, and discusses a proof that all bounded-loop CASL specifications terminate.
Resource-bounded alternating-time temporal logic
This paper extends ATL with costs of actions and hence of strategies, and gives a complete and sound axiomatisation of the resulting logic Resource-Bounded ATL (RB-ATL) and an efficient model-checking algorithm for it.
Verifying Existence of Resource-Bounded Coalition Uniform Strategies
This work extends previous work on verification of multi-agent systems where actions of agents produce and consume resources, by adding epistemic pre- and postconditions to actions, and defines a class of coalition-uniform strategies with respect to any (decidable) notion of coalition knowledge.
Model checking coalitional games in shortage resource scenarios
The main technical contribution is the proof of the EXPTIME-hardness of the the model checking problem for PRBATL, based on a reduction from the acceptance problem for Linearly-Bounded Alternating Turing Machines.
A Logic for Coalitions with Bounded Resources
This paper presents a Resource-Bounded Coalition Logic (RBCL) which has explicit representation of resource bounds in the language, and gives a complete and sound axiomatisation of RBCL.
On the (Un-)Decidability of Model Checking Resource-Bounded Agents
This work considers several natural logic-based settings that may arise and proves that verification is usually undecidable apart from bounded or otherwise restrictive settings and identifies various factors that influence the (un-)decidability.
Model checking agent programming languages
This is the first comprehensive approach to the verification of programs developed using programming languages based on the BDI (belief-desire-intention) model of agency, and develops a specific layer of abstraction that maps the semantics of agent programs into the relevant model-checking framework.
On the Boundary of (Un)decidability: Decidable Model-Checking for a Fragment of Resource Agent Logic
The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (un)decidability results and identify a significant fragment of the logic for which model checking