Proving the Correctness of the Implementation of a Control-Command Algorithm
From MaRDI portal
(Redirected from Publication:3392923)
Recommendations
Cites work
- A Hybrid Denotational Semantics for Hybrid Systems
- Abstract Interpretation Frameworks
- Abstract Interpretation of the Physical Inputs of Embedded Programs
- scientific article; zbMATH DE number 1301619 (Why is no real title available?)
- scientific article; zbMATH DE number 1953274 (Why is no real title available?)
- scientific article; zbMATH DE number 2080778 (Why is no real title available?)
- scientific article; zbMATH DE number 1507210 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Numerical Software with Result Verification
- Periodically Controlled Hybrid Systems
- Proving non-termination
- Proving that programs eventually do something good
- Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization
- Static Analysis in Disjunctive Numerical Domains
- Static Analysis of Numerical Algorithms
- Switching in systems and control
- Uniform Stability of Switched Linear Systems: Extensions of LaSalle's Invariance Principle
- Validated solutions of initial value problems for ordinary differential equations
- Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis
Cited in
(5)
This page was built for publication: Proving the Correctness of the Implementation of a Control-Command Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392923)