Skip to main content
SpringerLink
Log in

Distributed synthesis for regular and contextfree specifications

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

We consider the distributed realizability problem for systems with regular and deterministic contextfree local specifications. We characterize exactly the architectures for which the realizability problem is decidable. This extends known results on local specifications in two directions. First, architectures with cycles are allowed instead of just acyclic ones and second, deterministic contextfree specifications are considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. In [5] this situation where two reachable system processes are incomparably informed is called information fork.

References

  1. Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Am. Math. Soc. 138, 295–311 (1969)

    Article  MATH  Google Scholar 

  2. Church, A.: Application of recursive arithmetic to the problem of circuit synthesis. In: Summaries of the Summer Institute of Symbolic Logic, vol. 1, pp. 3–50. Cornell University (1957)

  3. Cohen, R.S., Gold, A.Y.: Omega-computations on deterministic pushdown machines. J. Comput. Syst. Sci. 16(3), 275–300 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  4. de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. In: FOCS, pp. 564–575. IEEE Computer Society (1998)

  5. Finkbeiner, B. Schewe, S.: Uniform distributed synthesis. In: LICS, pp. 321–330. IEEE Computer Society (2005)

  6. Finkel, O.: Topological properties of omega context-free languages. Theor. Comput. Sci. 262(1), 669–697 (2001)

    Article  MATH  Google Scholar 

  7. Fridman, W.: A study of pushdown games. Ph.D. thesis, RWTH Aachen University (2013)

  8. Fridman, W., Puchala, B.: Distributed synthesis for regular and contextfree specifications. In: Murlak, F., Sankowski, P. (eds.) MFCS, volume 6907 of Lecture Notes in Computer Science, pp. 532–543. Springer (2011)

  9. Kupferman, O., Piterman, N., Vardi, M.Y.: Pushdown specifications. In: Baaz, M, Voronkov, A. (eds.). LPAR, volume 2514 of Lecture Notes in Computer Science, pp. 262–277. Springer (2002)

  10. Kupferman, O., Vardi, M.Y.: Church’s problem revisited. Bull. Symb. Logic 5(2), 245–263 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: LICS, pp. 389–398. IEEE Computer Society (2001)

  12. Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP, volume 2076 of Lecture Notes in Computer Science, pp. 396–407. Springer (2001)

  13. Madhusudan, P.: Control and synthesis of open reactive systems. Ph.D. thesis, University of Madras, Chennai, India (2001)

  14. Peterson, G.L., Reif, J.H.: Multiple-person alternation. In: FOCS, pp. 348–363. IEEE Computer Society (1979)

  15. Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46–57. IEEE Computer Society (1977)

  16. Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: FOCS, pp. 746–757. IEEE Computer Society (1990)

  17. Puchala, B.: Synthesis of winning strategies for interaction under partial information. Ph.D. thesis, RWTH Aachen University (2013)

  18. Safra, S.: On the complexity of omega-automata. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, FOCS, pp. 319–327. IEEE Computer Society (1988)

  19. Walukiewicz, I.: Pushdown processes: games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV, volume 1102 of Lecture Notes in Computer Science, pp. 62–74. Springer (1996)

  20. Wong-Toi, H., Dill, D.L.: Synthesizing processes and schedulers from temporal specifications. In: Clarke, E.M., Kurshan, R.P. (eds.) CAV, volume 531 of Lecture Notes in Computer Science, pp. 272–281. Springer (1990)

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen University, Aachen, Germany

    Wladimir Fridman & Bernd Puchala

Authors
  1. Wladimir Fridman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernd Puchala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wladimir Fridman.

Additional information

A preliminary version of this article appeared as [8].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fridman, W., Puchala, B. Distributed synthesis for regular and contextfree specifications. Acta Informatica 51, 221–260 (2014). https://doi.org/10.1007/s00236-014-0194-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-014-0194-x

Search

Navigation