Specifying real-time properties with metric temporal logic
Real-Time Systems
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Model checking
Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Real-time Property Preservation in Approximations of Timed Systems
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Monitoring Algorithms for Metric Temporal Logic Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability analysis of nonlinear systems using conservative approximation
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
On systematic simulation of open continuous systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Reachability of uncertain linear systems using zonotopes
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
MTL robust testing and verification for LPV systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Robust test generation and coverage for hybrid systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Analog/mixed-signal circuit verification using models generated from simulation traces
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
AMT: a property-based monitoring tool for analog systems
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Analog property checkers: a DDR2 case study
Formal Methods in System Design
Robustness of temporal logic specifications
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Falsification of temporal properties of hybrid systems using the cross-entropy method
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Probabilistic Temporal Logic Falsification of Cyber-Physical Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing
Hi-index | 0.00 |
In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the verification of the temporal properties of a continuous system by verifying only a finite number of its (simulated) trajectories. The proposed framework comprises two main ideas. First, we take advantage of the fact that in metric spaces we can quantify how close are two different states. Based on that, we define robust, multi-valued semantics for MTL (and LTL) formulas. These capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance from unsatisfiability. Second, we use the recently developed notion of bisimulation functions to infer the behavior of a set of trajectories that lie in the neighborhood of the simulated one. If the latter set of trajectories is bounded by the tube of robustness, then we can infer that all the trajectories in the neighborhood of the simulated one satisfy the same temporal specification as the simulated trajectory. The interesting and promising feature of our approach is that the more robust the system is with respect to the temporal logic specification, the less is the number of simulations that are required in order to verify the system.