Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Symbolic Controller Synthesis for Discrete and Timed Systems
Hybrid Systems II
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Modal logics for timed control
CONCUR 2005 - Concurrency Theory
Robust parametric reachability for timed automata
Information Processing Letters
ACM Transactions on Computational Logic (TOCL)
Robust safety of timed automata
Formal Methods in System Design
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
Efficient on-the-fly algorithms for partially observable timed games
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Robust analysis of timed automata via channel machines
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Timed Modal Logics for Real-Time Systems
Journal of Logic, Language and Information
Quantitative robustness analysis of flat timed automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Timed automata can always be made implementable
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Robust model-checking of timed automata via pumping in channel machines
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Specifications for decidable hybrid games
Theoretical Computer Science
Systematic implementation of real-time models
FM'05 Proceedings of the 2005 international conference on Formal Methods
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On sampled semantics of timed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On transfinite hybrid automata
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Robust model-checking of linear-time properties in timed automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Minimum-time reachability in timed games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Undecidability of quantized state feedback control for discrete time linear hybrid systems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
The complexity of bounded synthesis for timed control with partial observability
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Frequencies in forgetful timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Shrinktech: a tool for the robustness analysis of timed automata
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Robust controller synthesis in timed automata
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Predictability of event occurrences in timed systems
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Information and Computation
| Hi-index | 0.00 |
In the literature, we find several formulations of the control problem for timed and hybrid systems. We argue that formulations where a controller can cause an action at any point in dense (rational or real) time are problematic, by presenting an example where the controller must act faster and faster, yet causes no Zeno effects (say, the control actions are at times 0, 1/2, 1, 1 1/4, 2, 2 1/8, 3, 3 1/16, . . . ). Such a controller is, of course, not implementable in software. Such controllers are avoided by formulations where the controller can cause actions only at discrete (integer) points in time. While the resulting control problem is well-understood if the time unit, or "sampling rate" of the controller, is fixed a priori, we define a novel, stronger formulation: the discrete-time control problem with unknown sampling rate asks if a sampling controller exists for some sampling rate. We prove that this problem is undecidable even in the special case of timed automata.