Incremental computation of succinct abstractions for hybrid systems
From MaRDI portal
Publication:3172856
Recommendations
Cites work
- scientific article; zbMATH DE number 5506101 (Why is no real title available?)
- scientific article; zbMATH DE number 1324833 (Why is no real title available?)
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
- Efficient solving of quantified inequality constraints over the real numbers
- Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate
- GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
- Logical Interpretation: Static Program Analysis Using Theorem Proving
- Safety verification of non-linear hybrid systems is quasi-semidecidable
- Sometime = always + recursion always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
- The essence of constraint propagation
Cited in
(4)
This page was built for publication: Incremental computation of succinct abstractions for hybrid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172856)