Safety verification of non-linear hybrid systems is quasi-semidecidable
From MaRDI portal
Publication:3569093
Recommendations
Cited in
(14)- Quasi-decidability of a fragment of the first-order theory of real numbers
- Automated Technology for Verification and Analysis
- scientific article; zbMATH DE number 1424031 (Why is no real title available?)
- Safety verification of non-linear hybrid systems is quasi-decidable
- A delta-sampling verification theorem for discrete-time, possibly discontinuous systems
- Assume-guarantee verification of nonlinear hybrid systems with ARIADNE
- \(\epsilon\)-semantics computations on biological systems
- Verification of Hybrid Systems
- Incremental computation of succinct abstractions for hybrid systems
- Safety verification for probabilistic hybrid systems
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
- GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
- Decidability of verification of safety properties of spatial families of linear hybrid automata
- Safety verification of hybrid systems using certified multiple Lyapunov-like functions
This page was built for publication: Safety verification of non-linear hybrid systems is quasi-semidecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569093)