On Distributed Program Specification and Synthesis in Architectures with Cycles
In this paper, we consider discrete distributed synthesis pro- blems, as defined by Pnueli and Rosner, 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.
KeywordsLocal Behavior Global Behavior Sequential Function Discrete Event System Environment Position
- 5.Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: IEEE Symp. on Logic in Computer Science (LICS), pp. 321–330 (2005)Google Scholar
- 6.Gastin, P., Lerman, B., Zeitoun, M.: Causal memory distributed games are decidable for series-parallel systems. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, Springer, Heidelberg (2004)Google Scholar
- 9.IEEE Std 1076-1993. IEEE Standard VHDL (1993)Google Scholar
- 10.Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: IEEE Symp. on Logic in Computer Science (LICS), pp. 389–398 (2001)Google Scholar
- 11.Madhusudan, P.: Control and Synthesis of Open Reactive Systems. PhD thesis, University of Madras (2001)Google Scholar
- 15.Peterson, G.L., Reif, J.H.: Multiple-person alternation. In: 20th Annual IEEE Symposium on Foundations of Computer Sciences, pp. 348–363 (October 1979)Google Scholar
- 17.Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: IEEE Symposium on Foundations of Computer Science, pp. 746–757 (1990)Google Scholar
- 19.Reif, J.H.: Universal games of incomplete information. In: 11th Annual ACM Symposium on Theory of Computing, pp. 288–308 (1979)Google Scholar