Logic in Computer Science, Symposium on (1996)

New Brunswick, NJ

July 27, 1996 to July 30, 1996

ISSN: 1043-6871

ISBN: 0-8186-7463-6

pp: 278

T.A. Henzinger , Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA

ABSTRACT

We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.

INDEX TERMS

finite automata; hybrid automata theory; discrete concurrent systems; partly continuous systems; finite-state systems; uncountable state spaces

CITATION

T.A. Henzinger,
"The theory of hybrid automata",

*Logic in Computer Science, Symposium on*, vol. 00, no. , pp. 278, 1996, doi:10.1109/LICS.1996.561342CITATIONS

SEARCH