Bounded and Unbounded Safety Verification Using Bisimulation Metrics
From MaRDI portal
Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1956636 (Why is no real title available?)
- Approximation Metrics for Discrete and Continuous Systems
- Automata Based Interfaces for Control and Scheduling
- Hybrid Systems: Computation and Control
- Robust Test Generation and Coverage for Hybrid Systems
- Systematic Simulation Using Sensitivity Analysis
- Verification of Supervisory Control Software Using State Proximity and Merging
Cited in
(5)- Safety, domain independence and generalized quantification
- Verifying relative safety, accuracy, and termination for program approximations
- Program constructions that are safe for bisimulation
- Proving nondeterministically specified safety properties using progress measures
- Bounded verification with on-the-fly discrepancy computation
This page was built for publication: Bounded and Unbounded Safety Verification Using Bisimulation Metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624590)
