A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Asynchronous Games over Tree Architectures
[chapter]
2013
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-39212-2_26
fatcat:e34z2gdmyba4zjp25gz4wl5hxy