Strategic Abilities of Asynchronous Agents: Semantic Paradoxes and How to Tame Them

by   Wojciech Jamroga, et al.

Recently, we proposed a framework for verification of agents' abilities in asynchronous multi-agent systems, together with an algorithm for automated reduction of models. The semantics was built on the modeling tradition of distributed systems. As we show here, this can sometimes lead to paradoxical interpretation of formulas when reasoning about the outcome of strategies. First, the semantics disregards finite paths, and thus yields counterintuitive evaluation of strategies with deadlocks. Secondly, the semantic representations do not allow to capture the asymmetry between active agents and the recipients of their choices. We propose how to avoid the problems by a suitable change of the semantics, and prove that the model reduction scheme still works in the modified framework.


page 1

page 2

page 3

page 4


Bisimulations for Verifying Strategic Abilities with an Application to the ThreeBallot Voting Protocol

We propose a notion of alternating bisimulation for strategic abilities ...

STV+AGR: Towards Practical Verification of Strategic Ability Using Assume-Guarantee Reasoning

We present a substantially expanded version of our tool STV for strategy...

Making Agents' Abilities Explicit

Alternating-time temporal logics (ATL/ATL*) represent a family of modal ...

Near-Optimal Adversarial Policy Switching for Decentralized Asynchronous Multi-Agent Systems

A key challenge in multi-robot and multi-agent systems is generating sol...

Budget-Constrained Coalition Strategies with Discounting

Discounting future costs and rewards is a common practice in accounting,...

The Persistence of False Memory: Brain in a Vat Despite Perfect Clocks

Recently, a detailed epistemic reasoning framework for multi-agent syste...

Reducing asynchrony to synchronized rounds

Synchronous computation models simplify the design and the verification ...