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.

Uložené v:

Podrobná bibliografia
Vydané v:	Logical methods in computer science Ročník 18, Issue 3; číslo 3
Hlavný autor:	Gimbert, Hugo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science Association 08.09.2022 Logical Methods in Computer Science e.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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