Paper Info
Title
Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge.
Abstract
We study the problem of controller synthesis for distributed systems modelled by Zielonka automata. While the decidability of this problem in full generality remains open and challenging, we suggest here to seek controllers from a parametrised family: we are interested in controllers that ensure frequent communication between the processes, where frequency is determined by the parameter. We show that this restricted controller synthesis version is affordable for synthesis standards: fixing the parameter, the problem is EXPTIME-complete.
Year
DOI
Venue
2013
10.1007/978-3-642-40313-2_61
Lecture Notes in Computer Science
Field
DocType
Volume
Parity game,Control theory,Computer science,Automaton,Decidability,Theoretical computer science,Tree automaton,Generality
Conference
8087
ISSN
Citations 
PageRank 
0302-9743
1
0.37
References 
Authors
23
2
Name
Order
Citations
PageRank
Anca Muscholl1117974.92
Sven Schewe249642.54