Open Systems in Reactive Environments: Control and Synthesis

  • Orna Kupferman
  • P. Madhusudan
  • P. S. Thiagarajan
  • Moshe Y. Vardi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1877)


We study the problems of synthesizing open systems as well as controllers for them. The key aspect of our model is that it caters to reactive environments, which can disable different sets of responses when reacting with the system. We deal with specifications given as formulas in CTL* and its sub-logic CTL. We show that both these problems, with specifications in CTL (CTL*), are 2EXPTIME-complete (resp. 3EXPTIME-complete). Thus, in a sense, reactive environments constitute a provably harder setting for the synthesis of open systems and controllers for them.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ALW89.
    M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th ICALP, LNCS 372, 1989.Google Scholar
  2. Ant95.
    M. Antoniotti. Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the Control-D system. PhD thesis, New York University, New York, 1995.Google Scholar
  3. BL69.
    J. R. Büchi and L.HG. Landweber. Solving sequential conditions by finite-state strategies. Trans. AMS, 138:295–311, 1969.CrossRefGoogle Scholar
  4. Chu63.
    A. Church. Logic, arithmetics, and automata. In Proc. International Congress of Mathematicians, 1962, pages 23–35. institut Mittag-Leffler, 1963.Google Scholar
  5. CKS81.
    A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1):114–133, January 1981.Google Scholar
  6. DTV99.
    M. Daniele, P. Traverso, and M. Y. Vardi. Strong cyclic planning revisited. In 5th European Conference on Planning, pages 34–46, 1999.Google Scholar
  7. EJ88.
    E. A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th FOCS, pages 328–337, White Plains, October 1988.Google Scholar
  8. Eme90.
    E. A. Emerson. Temporal and modal logic. Handbook of Theoretical Computer Science, pages 997–1072, 1990.Google Scholar
  9. HP85.
    D. Harel and A. Pnueli. On the development of reactive systems. In Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 477–498. Springer-Verlag, 1985.MathSciNetGoogle Scholar
  10. KG95.
    R. Kumar and V. K. Garg. Modeling and control of logical discrete event systems. Kluwer Academic Publishers, 1995.Google Scholar
  11. KS95.
    R. Kumar and M. A. Shayman. Supervisory control of nondeterministic systems under partial observation and decentralization. SIAM Journal of Control and Optimization, 1995.Google Scholar
  12. KV96.
    O. Kupferman and M. Y. Vardi. Module checking. In Proc. 8th CAV, LNCS 1102, pages 75–86, 1996.Google Scholar
  13. KV97.
    O. Kupferman and M. Y. Vardi. Module checking revisited. In Proc. 9th CAV, LNCS 1254, pages 36–47, 1997.Google Scholar
  14. KV99a.
    O. Kupferman and M. Y. Vardi. Church’s problem revisited. The Bulletin of Symbolic Logic, 5(2):245–263, June 1999.Google Scholar
  15. KV99b.
    O. Kupferman and M. Y. Vardi. Robust satisfaction. In Proc. 10th CONCUR, LNCS 1664, pages 383–398, 1999.Google Scholar
  16. KV00.
    O. Kupferman and M. Y. Vardi. μ-calculus synthesis. In Proc. 25th MFCS.Google Scholar
  17. Lam80.
    L. Lamport. Sometimes is sometimes “not never”-on the temporal logic of programs. In Proc. 7th POPL pages 174–185, January 1980.Google Scholar
  18. MT98.
    P. Madhusudan and P. S. Thiagarajan. Controllers for discrete event systems via morphisms. In Proc 9th CONCUR, LNCS 146, pages 18–33, 1998.Google Scholar
  19. MT00.
    P. Madhusudan and P. S. Thiagarajan. Branching time controllers for discrete event systems. To appear in CONCUR’ 98 Special Issue, Theoretical Computer Science, 2000.Google Scholar
  20. PR89.
    A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th POPL, pages 179–190, 1989.Google Scholar
  21. Rab69.
    M. O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1–35, 1969.zbMATHCrossRefMathSciNetGoogle Scholar
  22. Rab72.
    M. O. Rabin. Automata on infinite objects and Church’s problem. Amer. Mathematical Society, 1972.Google Scholar
  23. Saf88.
    S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symposium on Foundations of Computer Science, pages 319–327, October 1988.Google Scholar
  24. SVW87.
    A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217–237, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  25. Tho97.
    W. Thomas. Languages, automata, and logic. Handbook of Formal Language Theory, III:389–455, 1997.Google Scholar
  26. Var95.
    M. Y. Vardi. An automata-theoretic approach to fair realizability and synthesis. In Proc. 7th CAV, LNCS 939, pages 267–292, 1995.Google Scholar
  27. VS85.
    M. Y. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of programs. In Proc 17th STOC, pages 240–251, 1985.Google Scholar
  28. VW86.
    M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182–221, 1986.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Orna Kupferman
    • 1
  • P. Madhusudan
    • 2
  • P. S. Thiagarajan
    • 3
  • Moshe Y. Vardi
    • 4
  1. 1.Hebrew UniversityIsrael
  2. 2.The Institute of Mathematical SciencesIndia
  3. 3.Chennai Mathematical InstituteIndia
  4. 4.Rice UniversityUSA

Personalised recommendations