A new class of decidable hybrid systems
From MaRDI portal
(Redirected from A new class of decidable hybrid systems)
The hybrid systems here are discrete systems which ``locally realize continuous systems, essentially given via suitable vector fields, i.e. they combine continuous evolutions and discrete jumps. The interesting problem is that of reachability, i.e. whether some final state can be reached from some initial one. Using bisimulations, i.e. reachability preserving quotients, and results from standard model theory of theories of the ordered field of reals (partly including exponentiation) the authors show that the reachability problem becomes decidable for some classes of ``local vector fields. For the entire collection see [Zbl 0911.00057].
Recommendations
- Decidable hybrid systems
- A Class of Decidable Parametric Hybrid Systems
- scientific article; zbMATH DE number 1927563
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- A decidable class of planar linear hybrid systems
- A Decidable Class of Planar Linear Hybrid Systems
- On the decidability of stability of hybrid systems
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- scientific article; zbMATH DE number 6533399
- Deductive systems and the decidability problem for hybrid logics
Cited in
(45)- Hybrid systems: From verification to falsification by combining motion planning and discrete search
- Differential dynamic logic for hybrid systems
- Reachability and connectivity queries in constraint databases
- Decidable integration graphs.
- Decidable hybrid systems
- PTIME parametric verification of safety properties for reasonable linear hybrid automata
- A decidable class of planar linear hybrid systems
- On the expressiveness and decidability of o-minimal hybrid systems
- Taylor approximation for hybrid systems
- Monotonic hybrid systems
- Supervisory control of hybrid systems based on model abstraction and guided search
- Discrete-time hybrid modeling and verification of the batch evaporator process benchmark
- Reachability analysis of linear systems with stepwise constant inputs
- Expressive power of hybrid systems with variables, parameters and arrays
- Towards a hybrid dynamic logic for hybrid dynamic systems
- Some decidable results on reachability of solvable systems
- Deciding concurrent planar monotonic linear hybrid systems
- A Class of Decidable Parametric Hybrid Systems
- Decidability of the reachability for a family of linear vector fields
- STORMED Hybrid Systems
- A Decidable Class of Planar Linear Hybrid Systems
- Interrupt Timed Automata
- Periodically Controlled Hybrid Systems
- Property Driven Three-Valued Model Checking on Hybrid Automata
- Safety verification for probabilistic hybrid systems
- Theory and computation of discrete state space decompositions for hybrid systems
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- Hybrid systems with finite bisimulations
- SAT modulo linear arithmetic for solving polynomial constraints
- scientific article; zbMATH DE number 2084368 (Why is no real title available?)
- scientific article; zbMATH DE number 1927563 (Why is no real title available?)
- Interrupt timed automata: verification and expressiveness
- Topologies, Continuity and Bisimulations
- Approximated reachability on hybrid automata: falsification meets certification
- Finite bisimulations for dynamical systems with overlapping trajectories
- Formal language properties of hybrid systems with strong resets
- A survey of computational complexity results in systems and control
- Symbolic reachability computation for families of linear vector fields
- Bounded Verification of Reachability of Probabilistic Hybrid Systems
- Limit cycles of linear vector fields on \(( \mathbb{S}^2)^m \times \mathbb{R}^N\)
- On the decidability of reachability in continuous time linear time-invariant systems
- Reachability and mortality for two-dimensional RHPCD systems are co-NP-hard
- On the complexity of reachability and mortality for bounded piecewise affine maps
- Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
This page was built for publication: A new class of decidable hybrid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249569)
