Distributed Asynchronous Games With Causal Memory are Undecidable

We show the undecidability of the distributed control problem when the plant is an asynchronous automaton, the controllers use causal memory and the goal of the controllers is to put each process in a local accepting state.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Logical methods in computer science Jg. 18, Issue 3; H. 3
1. Verfasser:	Gimbert, Hugo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science Association 08.09.2022 Logical Methods in Computer Science e.V
Schlagworte:	Computer Science computer science - computer science and game theory Computer Science and Game Theory electrical engineering and systems science - systems and control Formal Languages and Automata Theory Distributed controllability
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We show the undecidability of the distributed control problem when the plant is an asynchronous automaton, the controllers use causal memory and the goal of the controllers is to put each process in a local accepting state.
ISSN:	1860-5974 1860-5974
DOI:	10.46298/lmcs-18(3:30)2022