Specifying real-time properties with metric temporal logic
Real-Time Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Discrete-Time Refinement of Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
Approximate Simulation Relations for Hybrid Systems
Discrete Event Dynamic Systems
PHAVer: algorithmic verification of hybrid systems past HyTech
International Journal on Software Tools for Technology Transfer (STTT)
Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Epsilon-Tubes and Generalized Skorokhod Metrics for Hybrid Paths Spaces
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
Towards component based design of hybrid systems: safety and stability
Time for verification
Robust satisfaction of temporal logic over real-valued signals
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
Science of Computer Programming
Playing hybrid games with keymaera
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Quantitative timed simulation functions and refinement metrics for real-time systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
Specifications and implementations of complex physical systems tend to differ as low level effects such as sampling are often ignored when high level models are created. Thus, the low level models are often not exact refinements of the high level specification. However, they are similar to those. To bridge the gap between those models, we study robust simulation relations for hybrid systems. We identify a family of robust simulation relations that allow for certain bounded deviations in the behavior of a system specification and its implementation in both values of the system variables and timings. We show that for this relaxed version of simulation a broad class of logical properties is preserved. The question whether two systems are in simulation relation can be reduced to a reach avoid problem for hybrid games. We provide a sufficient condition under which a winning strategy for these games exists.