The classical modelization of concurrent system behaviors is based on observing execution sequences of global states. This model is intuitively simple and enjoys a variety of mathematical tools, e.g. finite automata, helping verifying concurrent systems. On the other hand, parallel composition of local controllers are needed when dealing with the actual implementation of concurrent models. A well known tool for turning global observation into local controllers is Zielonka's theorem, and its derivatives. We give here another algorithm, simpler and cheaper than Zielonka's theorem, in the case where the events observed do not include communication but only local asynchronous actions. In a developer point of view, it means that she does not have to explicitly specify the messages needed, which will be added (if allowed) automatically by the implementation algorithm. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Genest, B. (2005). On implementation of global concurrent systems with local asynchronous controllers. In Lecture Notes in Computer Science (Vol. 3653, pp. 443–457). Springer Verlag. https://doi.org/10.1007/11539452_34
Mendeley helps you to discover research relevant for your work.