Modular interpreted systems

Abstract

We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representations borrow the main ideas from interpreted systems of Halpern, Fagin et al.; however, they are also modular and compact in the way concurrent programs are. We also mention preliminary results on model checking alternating-time temporal logic for this natural class of models.

Relaxing Exclusive Control in Boolean Games

“…Compact representations of CGS with exclusive control are a thriving subject of research in the formal verification community (see, e.g., [12,16,15]). There, so-called reactive modules define for every action whether it is available by means of a boolean formula.…”

Finding Uniform Strategies for Multi-agent Systems

“…The algorithm has exponential worst-case complexity, since it uses, as a subroutine, a procedure for finding all maximal cliques in a graph-a problem that is known to be NP-complete. Further research will be focused on reducing the complexity of the algorithm by using a model with an implicit representation of the incomplete information, e.g., modular interpreted systems [6] and with symbolic representation of the system state space.…”

“…We evaluate ATL u -formulas at sets of states, since when finding strategies, this will help us to find the maximal set at which the same strategy can be applied to achieve a certain outcome 6 (note that our motivation is quite different from that in [5]). Formally,…”

Refining and Delegating Strategic Ability in ATL

“…A formalization of teaming sub-agents under a scheduler as turn-based simulation was proposed in [GF10,GPS13]. Modelling varying the considered set of agents is addressed in modular interpreted systems [JÅ07,JMS13]. Distinctively, our setting is about varying the set of agents in a system by just redistributing strategic ability, with the overall activities which the system can accommodate unchanged.…”