The control of synchronous systems, Part II

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

Volumn 2154, Issue , 2001, Pages 566-581

  De Alfaro, Luca ^a   Henzinger, Thomas A ^a   Mang, Freddy Y C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC RANDOM ACCESS STORAGE; STATIC RANDOM ACCESS STORAGE;

COMPOSABILITY; CONTROL OBJECTIVES; CONTROL PROBLEMS; CYCLIC DEPENDENCIES; DEPENDENCY RELATION; DEPENDENT TYPES; RANDOM ACCESS MEMORY; SYNCHRONOUS SYSTEM;

CONTROLLERS;

EID: 84944075063     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_38     Document Type: Conference Paper

References (15)

1. R. Alur, L. de Alfaro, T. A. Henzinger, F. Y. C. Mang. Automating modular verification. In Concurrency Theory, LNCS 1664, pp. 82–97. Springer, 1999.
2. R. Alur and T.A. Henzinger. Reactive modules. Formal Methods in System Design,15:7–48,1999.
3. J.R. Büchi and L. H. Landweber. Solving sequential conditions by finitestate strategies. Trans. Amer. Math. Soc.,138: 295–311, 1969.
4. L. De Alfaro, T. A. Henzinger, F. Y. C. Mang. The control of synchronous systems. In Concurrency Theory, LNCS 1877, pp. 458–473. Springer, 2000.
5. L. de Alfaro, T. A. Henzinger, F.Y.C. Mang. Detecting errors before reaching them. In Computer-Aided Verification, LNCS 1855, pp. 186–201. Springer, 2000.
6. G. Berry and G. Gonthier. The Esterel Synchronous Programming Language: design, seman tics, implemen tation. Science Computer Programming, 19:87–152,1992.
7. Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc. Symp. Theory of Computing, pp. 60–65. ACM Press, 1982.
8. L. Henkin. Some remarks on infinitely long formulas. In Infinitistic Methods, pp. 167–183. Polish Scientific Publishers, 1961.
9. S. Malik. Analysis of cyclic combinational circuits. IEEE Trans. Computer-Aided Design, 13: 950–956, 1994.
10. R. McNaughton. Infinite games played on finite graphs. Ann. Pure and Applied Logic, 65: 149–184, 1993.
11. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Symp. Principles of Programming Languages, pp. 179–190. ACM Press, 1989.
12. R. Passerone, J. A. Rowson, A. L. Sangiovanni-Vincentelli. Automatic synthesis of interfaces between incompatible protocols. In Proc. Design Automation Conference, pp. 8–13. ACM Press, 1998.
13. P. J. Ramadge and W. M. Wonham. Supervisory control of a class of discrete-event processes. SIAM J. Control and Optimization, 25: 206–230, 1987.
14. PCI SIG. PCI local bus specification, rev. 2.2.
15. W. Thomas. On the synthesis of strategies in infinite games. In Theoretical Aspects of Computer Science, LNCS 900, pp. 1–13. Springer, 1995.