On the expressiveness and decidability of o-minimal hybrid systems

A theory of timed automata

Rajeev Alur, David L. Dill · Theoretical Computer Science · 1994 · 6.5K citations

Computing, Computer Science, Formal Methods +9

The algorithmic analysis of hybrid systems

Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs et al. · Theoretical Computer Science · 1995 · 1.9K citations · Full text

Computing, Computer Science, Mathematics +17

The theory of hybrid automata

Thomas A. Henzinger · 2002 · 1.9K citations

Computing, Computer Science, Mathematics +14

Complexity and real computation

Choice Reviews Online · 1998 · 1.3K citations

Computing, Computer Science, Mathematics +17

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

Lenore Blum, M. Shub, Steve Smale · Bulletin of the American Mathematical Society · 1989 · 1.1K citations · Full text

Computing, Computer Science, Mathematics +17