Incremental computation of succinct abstractions for hybrid systems
From MaRDI portal
Publication:3172856
DOI10.1007/978-3-642-24310-3_19zbMATH Open1348.68133OpenAlexW2154637232MaRDI QIDQ3172856FDOQ3172856
Stefan Ratschan, Tomáš Dzetkulič
Publication date: 7 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24310-3_19
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03)
Cites Work
- Title not available (Why is that?)
- The essence of constraint propagation
- Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable
- Efficient solving of quantified inequality constraints over the real numbers
- Logical Interpretation: Static Program Analysis Using Theorem Proving
- Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
- Title not available (Why is that?)
- GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
- Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate
Cited In (4)
Uses Software
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)