Skip to main content

Distributed Controller Synthesis for Local Specifications

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2076))

Included in the following conference series:

Abstract

We consider the problem of synthesizing distributed controllers for reactive systems against local specifications. We show that a larger class of architectures become decidable in comparison to the analogous problem for global specifications. We identify the exact class of architectures for which the problem is decidable. Our results also show the decidability of a related realizability problem for local specifications.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th IEEE FOCS, pages 100–109, October 1997.

    Google Scholar 

  2. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th ICALP, vol. 372, pages 1–17. LNCS, Springer-Verlag, July 1989.

    Google Scholar 

  3. J.R. Büchi and L.HG. Landweber. Solving sequential conditions by finite-state strategies. Trans. AMS, 138:295–311, 1969.

    Article  Google Scholar 

  4. Luca de Alfaro and Thomas A. Henzinger. Concurrent omega-regular games. In Proc., LICS’ 00, 15th Annual Conf., pages 141–154, 2000.

    Google Scholar 

  5. Luca de Alfaro, Thomas A. Henzinger, and F.Y.C. Mang. The control of synchronous systems. In Proc., CONCUR’ 00, 11th Int. Conf., vol. 1877 of LNCS, pages 458–473, Penn. State Univ, USA, Sept. 2000.

    Google Scholar 

  6. O. Kupferman, P. Madhusudan, P.S. Thiagarajan, and M. Vardi. Open systems in reactive environments: Control and synthesis. In Proc., CONCUR’ 00, 11th Int. Conf., vol. 1877 of LNCS, USA, Sept. 2000.

    Google Scholar 

  7. O. Kupferman and M.Y. Vardi. Module checking. In CAV, Proc. 8th Intl. Conf., vol. 1102 of LNCS, pages 75–86. Springer-Verlag, 1996.

    Google Scholar 

  8. O. Kupferman and M.Y. Vardi. Church’s problem revisited. The Bulletin of Symbolic Logic, 5(2):245–263, June 1999.

    Article  MATH  MathSciNet  Google Scholar 

  9. D.E. Muller and P.E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. Theoretical Computer Science, 141:69–107, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Madhusudan and P. S. Thiagarajan. Controllers for discrete event systems via morphisms. In In Proc., CONCUR’98, 9th Int. Conf., vol. 1466 of LNCS, pages. 18–33, France, September 1998.

    Google Scholar 

  11. G.L. Peterson and J.H. Reif. Multiple-person alternation. In Proc. 20th IEEE Symp. on FOCS, pages 348–363, 1979.

    Google Scholar 

  12. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symp. on Principles of Prog. Languages, Austin, January 1989.

    Google Scholar 

  13. A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. 31st IEEE Symp. FOCS, pages 746–757, 1990.

    Google Scholar 

  14. M.O. Rabin. Automata on infinite objects and Church’s problem. Amer. Mathematical Society, 1972.

    Google Scholar 

  15. P.J.G. Ramadge and W.M. Wonham. The control of discrete event systems. IEEE Transactions on Control Theory, 77:81–98, 1989.

    Google Scholar 

  16. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. FOCS, pages 319–327, White Plains, October 1988.

    Google Scholar 

  17. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165–191, 1990.

    Google Scholar 

  18. W. Thomas. On the synthesis of strategies in infinite games. In E.W. Mayr and C. Puech, editors, Proc. 12th Symp. on Theoretical Aspects of Comp. Sc., vol. 900 of LNCS, pages 1–13. Springer-Verlag, 1995.

    Google Scholar 

  19. P. Madhusudan and P. S. Thiagarajan. Distributed Controller Synthesis for Local Specifications. Technical Report TCS-01-1, Chennai Mathematical Institute, India. Available at http://www.smi.ernet.in

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madhusudan, P., Thiagarajan, P. (2001). Distributed Controller Synthesis for Local Specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-48224-5_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42287-7

  • Online ISBN: 978-3-540-48224-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics