Theoretical Computer Science
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Timed automata and recognizability
Information Processing Letters
The logic of event clocks: decidability, complexity and expressiveness
Automatica (Journal of IFAC)
Discrete-Time Control for Rectangular Hybrid Automata
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
A Determinizable Class of Timed Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Robust Undecidability of Timed and Hybrid Systems
Robust Undecidability of Timed and Hybrid Systems
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
A Comparison of Control Problems for Timed and Hybrid Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Discrete-Time Refinement of Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Elementarily computable functions over the real numbers and R-sub-recursive functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Timed Parity Games: Complexity and Robustness
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Robust computations with dynamical systems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On reachability for hybrid automata over bounded time
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Thin and thick timed regular languages
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Reachability problems for hybrid automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Safety verification of non-linear hybrid systems is quasi-semidecidable
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Real recursive functions and real extensions of recursive functions
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
The discrete time behavior of lazy linear hybrid automata
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Computation with perturbed dynamical systems
Journal of Computer and System Sciences
Robust weighted timed automata and games
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Safety verification of non-linear hybrid systems is quasi-decidable
Formal Methods in System Design
| Hi-index | 0.00 |
The algorithmic approach to the analysis of timed and hybrid systems is fundamentally limited by undecidability, of universality in the timed case (where all continuous variables are clocks), and of emptiness in the rectangular case (which includes drifting clocks). Traditional proofs of undecidability encode a single Turing computation by a single timed trajectory. These proofs have nurtured the hope that the introduction of "fuzziness" into timed and hybrid models (in the sense that a system cannot distinguish between trajectories that are sufficiently similar) may lead to decidability. We show that this is not the case, by sharpening both fundamental undecidability results. Besides the obvious blow our results deal to the algorithmic method, they also prove that the standard model of timed and hybrid systems, while not "robust" in its definition of trajectory acceptance (which is affected by tiny perturbations in the timing of events), is quite robust in its mathematical properties: the undecidability barriers are not affected by reasonable perturbations of the model.