Given the recent advances in synthesizing finite-state controllers from temporal logic specifications, the natural next goal is to synthesize more complex systems that consist of multiple distributed processes. The synthesis of distributed systems is, however, a hard and, in many cases, undecidable problem. In this paper, we investigate the synthesis problem for specifications that admit dominant strategies, i.e., strategies that perform at least as well as the best alternative strategy, although they do not necessarily win the game. We show that for such specifications, distributed systems can be synthesized compositionally, considering one process at a time. The compositional approach has dramatically better complexity and is uniformly applicable to all system architectures © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Damm, W., & Finkbeiner, B. (2014). Automatic compositional synthesis of distributed systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8442 LNCS, pp. 179–193). Springer Verlag. https://doi.org/10.1007/978-3-319-06410-9_13
Mendeley helps you to discover research relevant for your work.