Abstractions for hybrid systems
From MaRDI portal
Recommendations
- Series of abstractions for hybrid automata
- Compositional abstractions of hybrid control systems
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
- Reachability analysis of hybrid systems via predicate abstraction
- Finite abstractions for hybrid systems with stable continuous dynamics
Cites work
- Algorithmic analysis of nonlinear hybrid systems
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Approximate reachability for linear systems
- Barrier certificates for nonlinear model validation
- Counter-example guided predicate abstraction of hybrid systems
- Efficient representation and computation of reachable sets for hybrid systems
- scientific article; zbMATH DE number 439900 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 589124 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid systems: computation and control. 6th international workshop, HSCC 2003, Prague, Czech Republic, April 3--5, 2003. Proceedings
- Hybrid systems: computation and control. 7th international workshop, HSCC 2004, Philadelphia, PA, USA, March 25--27, 2004. Proceedings.
- Lateral inhibition through Delta-Notch signaling: A piecewise affine hybrid model
- Predicate abstraction for dense real-time systems
- Progress on reachability analysis of hybrid systems using predicate abstraction
- Proving properties of continuous systems: Qualitative simulation and temporal logic
- Series of abstractions for hybrid automata
- Symbolic reachability computation for families of linear vector fields
- The algorithmic analysis of hybrid systems
- Tools and algorithms for the construction and analysis of systems. 9th international conference TACAS 2003, held as part of the joint European conferences on theory and practice of software, ETAPS 2003, Warsaw, Poland, April 7--11, 2003. Proceedings
- Verification of hybrid systems based on counterexample-guided abstraction refinement
- Verification of infinite-state dynamic systems using approximate quotient transition systems
- Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations
- What's decidable about hybrid automata?
Cited in
(31)- Conic abstractions for hybrid systems
- Decentralized abstractions for multi-agent systems under coupled constraints
- Vector barrier certificates and comparison systems
- Pegasus: sound continuous invariant generation
- Bayesian statistical model checking with application to Stateflow/Simulink verification
- Finite abstraction of mixed monotone systems with discrete and continuous inputs
- Hybrid abstractions of affine systems
- Efficient finite abstraction of mixed monotone systems
- Incremental computation of succinct abstractions for hybrid systems
- Rigorous discretization of hybrid systems using process calculi
- Verification of Hybrid Systems
- Reconciling urgency and variable abstraction in a hybrid compositional setting
- Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems
- Finite abstractions for hybrid systems with stable continuous dynamics
- Hybrid abstractions that preserve timed languages
- Reachability analysis of hybrid systems via predicate abstraction
- Series of abstractions for hybrid automata
- Quantifier-free encoding of invariants for hybrid systems
- Verification and parameter synthesis for real-time programs using refinement of trace abstraction
- Facetal abstraction for non-linear dynamical systems based on δ-decidable SMT
- Assume-guarantee verification of nonlinear hybrid systems with ARIADNE
- Languages and Tools for Hybrid Systems Design
- Asynchronous correspondences between hybrid trajectory semantics
- Simulation relations and applications in formal methods
- Pegasus: a framework for sound continuous invariant generation
- A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets
- Compositional abstractions of hybrid control systems
- Verification of continuous dynamical systems by timed automata
- Implicit semi-algebraic abstraction for polynomial dynamical systems
- HRELTL: a temporal logic for hybrid systems
- Change-of-bases abstractions for non-linear hybrid systems
This page was built for publication: Abstractions for hybrid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2475634)