1995 · 521 citations · 15 references
ComputingComputer EngineeringComputer ScienceAlgorithmsFormal MethodsReal-time SystemsAutomata TheoryFinite AutomataFinite State Machine ModelingFinite-state MachinesHybrid SystemsHybrid Systems VerificationDecidabilityDecidability ProblemsHybrid AutomataNondeterminismReachabilityReachability AnalysisTimed AutomataUndecidability
Hybrid automata model systems with both digital and analog components, such az embedded control programs. Many verification tasks for such programs can be expressed as reachability problems for hybrid automata. By improving on previous decidability and undecidability results, we identify the precise boundary between decidability and undecidability of the reachability problem for hybrid automata.
15
Rajeev Alur, David L. Dill · Theoretical Computer Science · 1994 · 6.5K citations
The algorithmic analysis of hybrid systems
Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs et al. · Theoretical Computer Science · 1995 · 1.9K citations · Full text
Symbolic Model Checking for Real-Time Systems
Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis et al. · Information and Computation · 1994 · 830 citations · Full text