Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this paper suggests the novel approach of open synthesis under the assumptions of an environment that chooses its actions randomized rather than nondeterministically. Assuming a randomized environment inspires alternative semantics both for linear-time and branching-time logics. For linear-time, natural acceptance criteria are almost-sure and observable acceptance, where it suffices if the probability measure of accepting paths is 1 and greater than 0, respectively.
We distinguish 0-environments, which can freely assign probabilities to each environment action, from ε-environments, where the probabilities assigned by the environment are bound from below by some ε>0. While the results in case of 0-environments are essentially the same as for nondeterministic environments, the languages occurring in case of ε-environments are topologically different from the results for nondeterministic and 0-environments (in case of LTL, recognizable by weak alternating automata vs. recognizable by deterministic automata). The complexity of open synthesis is, in both cases, EXPTIME and 2EXPTIME-complete for CTL and LTL specifications, respectively.
KeywordsSynthesis Problem Winning Strategy Tree Automaton Classical Semantic Probabilistic Environment
Unable to display preview. Download preview PDF.
- 2.Anuchitanukul, A., Manna, Z.: Realizability and synthesis of reactive modules. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 156–168. Springer, Heidelberg (1994)Google Scholar
- 3.Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proc. IBM Workshop on Logics of Programs, pp. 52–71. Springer, Heidelberg (1981)Google Scholar
- 5.de Alfaro, L.: From fairness to chance. In: Proc. PROBMIV 1998 (1999)Google Scholar
- 6.Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Proc. LICS, pp. 321–330. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
- 7.Gurevich, Y., Harrington, L.: Trees, automata and games 14, 60–65 (1982)Google Scholar
- 9.Kupferman, O., Vardi, M.: Freedom, weakness, and determinism: From linear-time to branching-time. In: Proc. LICS (June 1995)Google Scholar
- 10.Kupferman, O., Vardi, M.Y.: Synthesis with incomplete information. In: Proc. ICTL, Manchester, pp. 91–106 (July 1997)Google Scholar
- 12.Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proc. LICS 2001, pp. 389–398. IEEE Computer Society Press, Los Alamitos (2001)Google Scholar
- 13.Lehmann, D., Rabin, M.O.: On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In: Proc. POPL 1981, pp. 133–138. ACM Press, New York (1981)Google Scholar
- 15.Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. POPL, pp. 179–190. ACM Press, New York (1989)Google Scholar
- 18.Wolper, P.: Synthesis of Communicating Processes from Temporal-Logic Specifications. PhD thesis, Stanford University (1982)Google Scholar