Discrete-time control systems
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
A Modular Visual Model for Hybrid Systems
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Compositional Refinement for Hierarchical Hybrid Systems
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Sampling Semantics of Duration Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Generating Sound and Resource-Aware Code from Hybrid Systems Models
Model-Driven Development of Reliable Automotive Services
Automating verification of cooperation, control, and design in traffic applications
Formal methods and hybrid real-time systems
Towards component based design of hybrid systems: safety and stability
Time for verification
Crossing the bridge between similar games
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Rigorous discretization of hybrid systems using process calculi
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
| Hi-index | 0.00 |
Notations like hybrid automata are highly useful in the development process of hybrid systems to document requirements in early design steps. When it comes to implementation a part of the requirements will be realized in software in a discrete-time manner. We therefore study sufficient conditions which ensure that an automaton operating in discrete-time refines a hybrid automaton with its underlying continuous time model. Our notion of refinement provides that vital properties which have been established for the hybrid automaton also hold for its refinement. Furthermore, we outline a method how to derive a discrete-time refinement from a hybrid automaton.