Name
Abstract | ||
|---|---|---|
The decidability of the distributed version of the Ramadge and Wonham controller synthesis problem,where both the plant and the controllers are modeled as asynchronous automataand the controllers have causal memoryis a challenging open problem.There exist three classes of plants for which the existence of a correct controller causal memory has been shown decidable: the dependency graph of actions is series-parallel, when the processes are connectedly communicating and the dependency graph of processes is a tree. We design a class of plants, called decomposable games, with a decidable controller synthesis problem.This provides a unified proof of the three existing decidability results as well as new examples of decidable plants. |
Year | Venue | Field |
|---|---|---|
2017 | FSTTCS | Asynchronous communication,Discrete mathematics,Control theory,Open problem,Computer science,Automaton,Decidability,Theoretical computer science,Dependency graph |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
8 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gimbert, H. | 1 | 5 | 3.21 |