Publication:4249569

zbMath0926.93036MaRDI QIDQ4249569

Sergio Yovine, Gerardo Lafferriere, George J. Pappas

Publication date: 22 November 1999

zbMATH Keywords

hybrid systems; reachability; decidability; bisimulations

Mathematics Subject Classification ID

93B12: Variable structure systems

03C99: Model theory

93B03: Attainable sets, reachability

93C30: Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems)

Related Items

Topologies, Continuity and Bisimulations, Approximated Reachability on Hybrid Automata: Falsification meets Certification, 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, Reachability analysis of linear systems with stepwise constant inputs, Safety verification for probabilistic hybrid systems, SAT modulo linear arithmetic for solving polynomial constraints, Interrupt timed automata: verification and expressiveness, 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, PTIME parametric verification of safety properties for reasonable linear hybrid automata, 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, Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems, Interrupt Timed Automata, Periodically Controlled Hybrid Systems, Property Driven Three-Valued Model Checking on Hybrid Automata