Name
Abstract | ||
|---|---|---|
We consider the distributed control problem in the setting of Zielonka asynchronous automata. Such automata are compositions of finite processes communicating via shared actions and evolving asynchronously. Most importantly, processes participating in a shared action can exchange complete information about their causal past. This gives more power to controllers, and avoids simple pathological undecidable cases as in the setting of Pnueli and Rosner. We show the decidability of the control problem for Zielonka automata over acyclic communication architectures. We provide also a matching lower bound, which is l-fold exponential, l being the height of the architecture tree. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-39212-2_26 | international colloquium on automata languages and programming |
Keywords | DocType | Volume |
complete information,acyclic communication architecture,finite process,shared action,tree architecture,zielonka asynchronous automaton,asynchronous game,causal past,architecture tree,avoids simple pathological undecidable,control problem,zielonka automaton | Conference | abs/1204.0077 |
ISSN | Citations | PageRank |
0302-9743 | 11 | 0.58 |
References | Authors | |
23 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Blaise Genest | 1 | 304 | 25.09 |
| Hugo Gimbert | 2 | 249 | 21.31 |
| Anca Muscholl | 3 | 1179 | 74.92 |
| Igor Walukiewicz | 4 | 1239 | 90.24 |