Hybrid Systems: Computation and Control
From MaRDI portal
Publication:5703953
DOI10.1007/B106766zbMath1078.93508OpenAlexW2502452588MaRDI QIDQ5703953
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106766
Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items (33)
Syntax and consistent equation semantics of hybrid Chi ⋮ Deadness and how to disprove liveness in hybrid dynamical systems ⋮ Crossing the Bridge between Similar Games ⋮ Verification of Hybrid Systems ⋮ An Introduction to the Verification of Hybrid Systems Using Ariadne ⋮ Formal Verification Applied to Robotic Surgery ⋮ Control barrier functions for stochastic systems ⋮ An efficient framework for barrier certificate generation of uncertain nonlinear hybrid systems ⋮ Efficient choice of parameters on delta-reachability bounded hybrid systems ⋮ Extracting counterexamples induced by safety violation in linear hybrid systems ⋮ Formal Modelling, Analysis and Verification of Hybrid Systems ⋮ Hybrid automata-based CEGAR for rectangular hybrid systems ⋮ Exact safety verification of hybrid systems using sums-of-squares representation ⋮ Bounded Verification of Reachability of Probabilistic Hybrid Systems ⋮ Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions ⋮ Formal verification and quantitative metrics of MPSoC data dynamics ⋮ Unnamed Item ⋮ On a decision procedure for quantified linear programs ⋮ An approximation algorithm for box abstraction of transition systems on real state spaces ⋮ A compositional modelling and analysis framework for stochastic hybrid systems ⋮ Hybrid automata, reachability, and systems biology ⋮ MetiTarski: An automatic theorem prover for real-valued special functions ⋮ Language-Based Abstraction Refinement for Hybrid System Verification ⋮ Symbolic Model Checking of Hybrid Systems Using Template Polyhedra ⋮ Applications of MetiTarski in the Verification of Control and Hybrid Systems ⋮ Benchmarks ⋮ Property Driven Three-Valued Model Checking on Hybrid Automata ⋮ Tightened reachability constraints for the verification of linear hybrid systems ⋮ Approximated Reachability on Hybrid Automata: Falsification meets Certification ⋮ Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers ⋮ Implicit definitions with differential equations for KeYmaera X (system description) ⋮ Rigorous integration of non-linear ordinary differential equations in Chebyshev basis ⋮ Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
Uses Software
This page was built for publication: Hybrid Systems: Computation and Control