Computer organization and design (2nd ed.): the hardware/software interface
Computer organization and design (2nd ed.): the hardware/software interface
Distributed Controller Synthesis for Local Specifications
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Control of Synchronous Systems, Part II
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Decidable Class of Asynchronous Distributed Controllers
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Universal games of incomplete information
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Synthesizing Distributed Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Tree automata and discrete distributed games
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Distributed synthesis for well-connected architectures
Formal Methods in System Design
| Hi-index | 0.00 |
In this paper, we consider discrete distributed synthesis pro- blems, as defined by Pnueli and Rosner[17], on possibly cyclic architectures with zero-delay semantics and global specifications. We describe a uniform (and complete) translation of these problems into distributed games problems. We prove the correctness of this translation and we also obtain, in this setting, a characterization of distributed architectures with decidable synthesis problems. It shall be noted that, as opposed to former approaches, zero-delay semantics requires a specific treatment for modeling instantaneous value propagation. Moreover, cyclic dependencies with zero-delay semantics involve equations with potentially many solutions. Accordingly, several variants of the distributed synthesis problem are proposed and studied.