Hybrid Systems: Computation and Control

DOI10.1007/b96398zbMath1135.93353OpenAlexW2476491145MaRDI QIDQ5307470

Christophe Troestler, Cédric Rivière, Thomas Brihaye, Christian Michaux

Publication date: 25 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b96398

Mathematics Subject Classification ID

Control/observation systems involving computers (process control, etc.) (93C83) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03) Model theory of ordered structures; o-minimality (03C64)

Related Items (19)

On the expressiveness and decidability of o-minimal hybrid systems ⋮ Symbolic models for control systems ⋮ A game-theoretic approach to fault diagnosis and identification of hybrid systems ⋮ Weighted o-minimal hybrid systems ⋮ PTIME parametric verification of safety properties for reasonable linear hybrid automata ⋮ Unnamed Item ⋮ Decidable Compositions of O-Minimal Automata ⋮ Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets ⋮ Unnamed Item ⋮ Formal language properties of hybrid systems with strong resets ⋮ Inclusion dynamics hybrid automata ⋮ Language-Based Abstraction Refinement for Hybrid System Verification ⋮ A note on the undecidability of the reachability problem for o-minimal dynamical systems ⋮ Bounds on sizes of finite bisimulations of Pfaffian dynamical systems ⋮ Property Driven Three-Valued Model Checking on Hybrid Automata ⋮ Approximated Reachability on Hybrid Automata: Falsification meets Certification ⋮ Computing combinatorial types of trajectories in Pfaffian dynamics ⋮ Relaxing Goodness Is Still Good ⋮ Decisiveness of stochastic systems and its application to hybrid models

This page was built for publication: Hybrid Systems: Computation and Control