The control of synchronous systems

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

Volumn 1877 LNCS, Issue , 2000, Pages 458-473

  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

BOOLEAN ALGEBRA; CONTROLLERS;

COMBINATIONAL LOOPS; CONTROL OBJECTIVES; CONTROL PROBLEMS; EXPONENTIAL TIME; INPUT AND OUTPUTS; LEVEL-SENSITIVE LATCH; SYNCHRONOUS COMPOSITION; SYNCHRONOUS SYSTEM; BOOLEAN FORMULAE;

PROCESS CONTROL;

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

References (23)

1. R. Alur and T.A. Henzinger. Computer-aided Verification: An Introduction to Model Building and Model Checking for Concurrent Systems. Draft, 1998.
2. R. Alur and T.A. Henzinger. Reactive modules. Formal Methods in System Design, 15: 7-48, 1999.
3. M. Abadi and L. Lamport. Conjoining specifications. ACM Trans. Programming Languages and Systems, 17: 507-534, 1995.
4. A. Blass and Y. Gurevich. Henkin quantifiers and complete problems. Ann. Pure and Applied Logic, 32: 1-16, 1986.
5. G. Berry and G. Gonthier. The synchronous programming language Esterel: Design, semantics, implementation. Technical Report 842, INRIA, 1988.
6. J.R. Büchi and L.H. Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc., 138: 295-311, 1969.
7. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. J. ACM, 28: 114-133, 1981.
8. E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus, and determinacy. In Proc. Symp. on Foundations of Computer Science, pp. 368-377. IEEE Press, 1991.
9. Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc. Symp. Theory of Computing, pp. 60-65. ACM Press, 1982.
10. G. Gottlob, N. Leone, and H. Veith. Second-order logic and the weak exponential hierarchies. In Mathematical Foundations of Compuer Science, LNCS 969, pp. 66-81. Springer-Verlag, 1995.
11. N. Halbwachs. Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, 1993.
12. L. Henkin. Some remarks on infinitely long formulas. In Infinitistic Method s, pp. 167-183. Polish Scientific Publishers, 1961.
13. T.A. Henzinger and P.W. Kopke. Discrete-time control for rectangular hybrid automata. In Automata, Languages, and Programming, LNCS 1256, pp. 582-593. Springer-Verlag, 1997.
14. R.P. Kurshan. Computer-aided Verification of Coordinating Processes. Princeton University Press, 1994.
15. N.A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
16. K.L. McMillan. A compositional rule for hardware design refinement. In Computer-aided Verification, LNCS 1254, pp. 24-35. Springer-Verlag, 1997.
17. R. McNaughton. Infinite games played on finite graphs. Ann. Pure and Applied Logic, 65: 149-184, 1993.
18. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
19. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
20. 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.
21. W. Thomas. On the synthesis of strategies in infinite games. In Theoretical Aspects of Computer Science, LNCS 900, pp. 1-13. Springer-Verlag, 1995.
22. J.G. Thistle and W.M. Wonham. Control of infinite behavior of finite automata. SIAM J. Control and Optimization, 32: 1075-1097, 1994.
23. W. Walkoe. Finite partially-ordered quantification. J. Symbolic Logic, 35: 535-555, 1970.