Communication and Concurrency
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
Ellipsoidal Techniques for Reachability Analysis
HSCC '00 Proceedings of the Third 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
On Control with Bounded Computational Resources
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Quantifying the Gap between Embedded Control Models and Time-Triggered Implementations
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Abstractions for hybrid systems
Formal Methods in System Design
Verification of Supervisory Control Software Using State Proximity and Merging
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Computing Differential Invariants of Hybrid Systems as Fixedpoints
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Constraint-Based Approach for Analysis of Hybrid Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Trajectory Based Verification Using Local Finite-Time Invariance
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Bounded and Unbounded Safety Verification Using Bisimulation Metrics
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Modeling and Analysis of Multi-hop Control Networks
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Reachability Analysis of Hybrid Systems Using Support Functions
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Systematic simulation using sensitivity analysis
HSCC'07 Proceedings of the 10th 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
Automata based interfaces for control and scheduling
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Verification of hybrid systems based on counterexample-guided abstraction refinement
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Progress on reachability analysis of hybrid systems using predicate abstraction
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
Efficient representation and computation of reachable sets for hybrid systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Efficient computation of reachable sets of linear time-invariant systems with inputs
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
HSCC'06 Proceedings of the 9th 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
Safety verification of hybrid systems by constraint propagation based abstraction refinement
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Hi-index | 0.00 |
We consider verification problems for transition systems enriched with a metric structure. We believe that these metric transition systems are particularly suitable for the analysis of cyber-physical systems in which metrics can be naturally defined on the numerical variables of the embedded software and on the continuous states of the physical environment. We consider verification of bounded and unbounded safety properties, as well as bounded liveness properties. The transition systems we consider are nondeterministic, finitely branching, and with a finite set of initial states. Therefore, bounded safety/liveness properties can always be verified by exhaustive exploration of the system trajectories. However, this approach may be intractable in practice, as the number of trajectories usually grows exponentially with respect to the considered bound. Furthermore, since the system we consider can have an infinite set of states, exhaustive exploration cannot be used for unbounded safety verification. For bounded safety properties, we propose an algorithm which combines exploration of the system trajectories and state space reduction using merging based on a bisimulation metric. The main novelty compared to an algorithm presented recently by Lerda et al. [2008] consists in introducing a tuning parameter that improves the performance drastically. We also establish a procedure that allows us to prove unbounded safety from the result of the bounded safety algorithm via a refinement step. We then adapt the algorithm to handle bounded liveness verification. Finally, the effectiveness of the approach is demonstrated by applying it to the analysis of implementations of an embedded control loop.