Symbolic Reachability Computation for Families of Linear Vector Fields

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

Symbolic Model Checking for Real-Time Systems

Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis et al. · Information and Computation · 1994 · 830 citations · Full text

Computing, Computer Science, Formal Methods +16

Partial Cylindrical Algebraic Decomposition for quantifier elimination

George E. Collins, Hoon Hong · Journal of Symbolic Computation · 1991 · 532 citations

Natural Sciences, Computer Science, Mathematics +8

What's decidable about hybrid automata?

Thomas A. Henzinger, Peter W. Kopke, Anuj Puri et al. · 1995 · 521 citations · Full text

Computing, Computer Engineering, Computer Science +17