Abstract
We adress the controller synthesis problem for distributed systems with regular and deterministic contextfree specifications. Our main result is a complete characterization of the decidable architectures for local specifications. This extends existing results on local specifications in two directions. First, we consider arbitrary, not necessarily acyclic, architectures and second, we allow deterministic contextfree specifications. Moreover, we show that as soon as one considers global deterministic contextfree specifications, even very simple architectures are undecidable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Büchi, J.R., Landweber, L.H.: Solving Sequential Conditions by Finite-State Strategies. Trans. Amer. Math. Soc. 138, 367–378 (1969)
Church, A.: Applications of Recursive Arithmetic to the Problem of Circuit Synthesis. Sum. of the Sum. Inst. of Symb. Log. I, 3–50 (1957)
Cohen, R.S., Gold, A.Y.: Theory of Omega-Languages. I. Characterizations of Omega-Context-Free Languages. J. Comput. Syst. Sci. 15(2) (1977)
de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent Reachability Games. In: FOCS 1998 (1998)
Finkbeiner, B., Schewe, S.: Uniform Distributed Synthesis. In: LICS 2005, pp. 321–330. IEEE, Los Alamitos (2005)
Finkel, O.: Topological Properties of Omega Context-Free Languages. Theor. Comput. Sci. 262(1) (2001)
Kupferman, O., Piterman, N., Vardi, M.Y.: Pushdown Specifications. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol. 2514, Springer, Heidelberg (2002)
Kupferman, O., Vardi, M.Y.: Church’s Problem Revisited. Bulletin of Symbolic Logic 5(2) (1999)
Kupferman, O., Vardi, M.Y.: Synthesizing Distributed Systems. In: LICS 2001 (2001)
Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 396–407. Springer, Heidelberg (2001)
Pnueli, A.: The Temporal Logic of Programs. In: FOCS 1977. IEEE, Los Alamitos (1977)
Pnueli, A., Rosner, R.: On the Synthesis of a Reactive Module. In: POPL 1989, pp. 179–190 (1989)
Pnueli, A., Rosner, R.: Distributed Reactive Systems are Hard to Synthesize. In: FOCS 1990, pp. 746–757. IEEE, Los Alamitos (1990)
Rabin, M.O.: Automata on Infinite Objects and Church’s Problem. Amer. Math. Soc., Providence (1972)
Safra, S.: On the Complexity of Omega-Automata. In: FOCS 1988 (1988)
Walukiewicz, I.: Pushdown Processes: Games and Model Checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 62–74. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Fridman, W., Puchala, B. (2011). Distributed Synthesis for Regular and Contextfree Specifications. In: Murlak, F., Sankowski, P. (eds) Mathematical Foundations of Computer Science 2011. MFCS 2011. Lecture Notes in Computer Science, vol 6907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22993-0_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-22993-0_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22992-3
Online ISBN: 978-3-642-22993-0
eBook Packages: Computer ScienceComputer Science (R0)