A decidable class of asynchronous distributed controllers

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

Volumn 2421 LNCS, Issue , 2002, Pages 145-160

  Madhusudan, P ^a   Thiagarajan, P S ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; SPECIFICATIONS; CONTROLLERS;

CONTROLLER SYNTHESIS; DISTRIBUTED CONTROLLER; FINITE SET; LINEAR TIME SPECIFICATION; LOCAL ENVIRONMENTS; LOCAL STRATEGIES;

CONTROLLERS; PROBLEM SOLVING;

EID: 84874698374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_11     Document Type: Conference Paper

References (16)

1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th Int. Coll. on Automata, Languages and Programming, volume 372 of LNCS, pages 1-17. Springer-Verlag, 1989.
2. J. R. Büchi and L. H. Landweber. Solving sequential conditions by finite-state strategies. Trans. AMS, 138:295-311, 1969.
3. A. Church. Logic, arithmetics, and automata. In Proc. International Congress of Mathematicians, 1962, pages 23-35. institut Mittag-Leffler, 1963.
4. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
5. J. G. Henriksen and P. S. Thiagarajan. Distributed versions of Linear time temporal logic. In Lectures on Petri Nets: Basic Models, volume 1491 of Lecture Notes in Computer Science, pages 643-682. Springer-Verlag, (1998).
6. O. Kupferman and M. Y. Vardi. Church's problem revisited. The Bulletin of Symbolic Logic, 5(2):245 - 263, June 1999.
7. O. Kupferman and M. Vardi. μ-calculus synthesis. In MFCS: Symposium on Mathematical Foundations of Computer Science, vol. 1893 of LNCS, 2000.
8. O. Kupferman and M. Vardi. Synthesizing distributed systems. In 16th Annual IEEE Symp on Logic in Computer Science, pages 16-19, USA, 2001. IEEE Comp. Society.
9. N. A. Lynch. Distributed Algorithms Morgan Kaufmann Publ. Inc., 1996.
10. P. Madhusudan. Control and synthesis of open reactive systems. PhD thesis, Institute of Mathematical Sciences, 2001.
11. P. Madhusudan and P. S. Thiagarajan. Distributed control and synthesis for local specifications. In Proc., ICALP '01, volume 2076 of LNCS, July 2001.
12. G. L. Peterson and J. H. Reif. Multiple-person alternation. In Proc. 20th IEEE Symposium on Foundation of Computer Science, pages 348-363, 1979.
13. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symposium on Principles of Programming Languages, 1989.
14. A. Pnueli and R. Rosner. On the synthesis of an asynchronous reactive module. In Proc. 16th ICALP, volume 372, pages 652-671. LNCS, 1989.
15. A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. 31st IEEE Symp. on Foundation of Comp. Sc., pages 746-757, 1990.
16. W. Thomas. Automata on Infinite Objects. In Handbook of Theoretical Comp. Sc., volume B, pages 135-191, Elsevier, 1995.