Distributed controller synthesis for local specifications

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

Volumn 2076 LNCS, Issue , 2001, Pages 396-407

  Madhusudan, P ^a   Thiagarajan, P S ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS;

DISTRIBUTED CONTROLLER; REACTIVE SYSTEM; REALIZABILITY;

SPECIFICATIONS;

EID: 84879545216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_33     Document Type: Conference Paper

References (19)

1. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th IEEE FOCS, pages 100-109, October 1997.
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.
3. J. R. Büchi and L. HG. Landweber. Solving sequential conditions by finite-state strategies. Trans. AMS, 138:295-311, 1969.
4. Luca de Alfaro and Thomas A. Henzinger. Concurrent omega-regular games. In Proc. , LICS '00, 15th Annual Conf. , pages 141-154, 2000.
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.
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.
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.
8. O. Kupferman and M. Y. Vardi. Church's problem revisited. The Bulletin of Symbolic Logic, 5(2):245-263, June 1999.
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.
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.
11. G. L. Peterson and J. H. Reif. Multiple-person alternation. In Proc. 20th IEEE Symp. on FOCS, pages 348-363, 1979.
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.
13. A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. 31st IEEE Symp. FOCS, pages 746-757, 1990.
14. M. O. Rabin. Automata on infinite objects and Church's problem. Amer. Mathematical Society, 1972.
15. P. J. G. Ramadge and W. M. Wonham. The control of discrete event systems. IEEE Transactions on Control Theory, 77:81-98, 1989.
16. S. Safra. On the complexity of-automata. In Proc. 29th IEEE Symp. FOCS, pages 319-327, White Plains, October 1988.
17. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191, 1990.
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.
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