Open systems in reactive environments: Control and synthesis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1877 LNCS, Issue , 2000, Pages 92-107

  Kupferman, Orna ^a   Madhusudan, P ^b   Thiagarajan, P S ^c   Vardi, Moshe Y ^d  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^c CHENNAI MATHEMATICAL INSTITUTE   (India)

^d RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; SPECIFICATIONS;

SPECIFICATIONS; SYNTHESIS (CHEMICAL);

EID: 84885234181     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_9     Document Type: Conference Paper

References (28)

1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th ICALP, LNCS 372, 1989.
2. 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.
3. J.R. Büchi and L.HG. Landweber. Solving sequential conditions by finite-state strategies. Trans. AMS, 138: 295-311, 1969.
4. A. Church. Logic, arithmetics, and automata. In Proc. International Congress of Mathematicians, 1962, pages 23-35. institut Mittag-Leffler, 1963.
5. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1): 114-133, January 1981.
6. M. Daniele, P. Traverso, and M.Y. Vardi. Strong cyclic planning revisited. In 5th European Conference on Planning, pages 34-46, 1999.
7. 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.
8. E.A. Emerson. Temporal and modal logic. Handbook of Theoretical Computer Science, pages 997-1072, 1990.
9. 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.
10. R. Kumar and V.K. Garg. Modeling and control of logical discrete event systems. Kluwer Academic Publishers, 1995.
11. R. Kumar and M.A. Shayman. Supervisory control of nondeterministic systems under partial observation and decentralization. SIAM Journal of Control and Optimization, 1995.
12. O. Kupferman and M.Y. Vardi. Module checking. In Proc. 8th CAV, LNCS 1102, pages 75-86, 1996.
13. O. Kupferman and M.Y. Vardi. Module checking revisited. In Proc. 9th CAV, LNCS 1254, pages 36-47, 1997.
14. O. Kupferman and M.Y. Vardi. Church's problem revisited. The Bulletin of Symbolic Logic, 5(2): 245-263, June 1999.
15. O. Kupferman and M.Y. Vardi. Robust satisfaction. In Proc. 10th CONCUR, LNCS 1664, pages 383-398, 1999.
16. O. Kupferman and M.Y. Vardi. μ-calculus synthesis. In Proc. 25th MFCS.
17. L. Lamport. Sometimes is sometimes "not never," - on the temporal logic of programs. In Proc. 7th POPL pages 174-185, January 1980.
18. P. Madhusudan and P.S. Thiagarajan. Controllers for discrete event systems via morphisms. In Proc 9th CONCUR, LNCS 146, pages 18-33, 1998.
19. P. Madhusudan and P.S. Thiagarajan. Branching time controllers for discrete event systems. To appear in CONCUR'98 Special Issue, Theoretical Computer Science, 2000.
20. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th POPL, pages 179-190, 1989.
21. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141: 1-35, 1969.
22. M.O. Rabin. Automata on infinite objects and Church's problem. Amer. Mathematical Society, 1972.
23. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symposium on Foundations of Computer Science, pages 319-327, October 1988.
24. 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.
25. W. Thomas. Languages, automata, and logic. Handbook of Formal Language Theory, III: 389-455, 1997.
26. M.Y. Vardi. An automata-theoretic approach to fair realizability and synthesis. In Proc. 7th CAV, LNCS 939, pages 267-292, 1995.
27. M.Y. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of programs. In Proc 17th STOC, pages 240-251, 1985.
28. 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.