Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2020
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910790513065984 |
|---|---|
| author | Jamroga, Wojciech Penczek, Wojciech Sidoruk, Teofil |
| author_facet | Jamroga, Wojciech Penczek, Wojciech Sidoruk, Teofil |
| contents | Recently, we have 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 counterintuitive interpretation of formulas when reasoning about the outcome of strategies. First, the semantics disregards finite paths, and thus yields unnatural evaluation of strategies with deadlocks. Secondly, the semantic representations do not allow to capture the asymmetry between proactive agents and the recipients of their choices. We propose how to avoid the problems by a suitable extension of the representations and change of the execution semantics for asynchronous MAS. We also prove that the model reduction scheme still works in the modified framework. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2003_03867 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them Jamroga, Wojciech Penczek, Wojciech Sidoruk, Teofil Logic in Computer Science Multiagent Systems Recently, we have 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 counterintuitive interpretation of formulas when reasoning about the outcome of strategies. First, the semantics disregards finite paths, and thus yields unnatural evaluation of strategies with deadlocks. Secondly, the semantic representations do not allow to capture the asymmetry between proactive agents and the recipients of their choices. We propose how to avoid the problems by a suitable extension of the representations and change of the execution semantics for asynchronous MAS. We also prove that the model reduction scheme still works in the modified framework. |
| title | Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them |
| topic | Logic in Computer Science Multiagent Systems |
| url | https://arxiv.org/abs/2003.03867 |