Theory and computation of discrete state space decompositions for hybrid systems

DOI10.1016/J.EJCON.2012.09.001zbMath1293.93129OpenAlexW2085444703MaRDI QIDQ397399

Maria Domenica Di Benedetto, Elena De Santis

Publication date: 12 August 2014

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejcon.2012.09.001

zbMATH Keywords

decompositionverification problem

Mathematics Subject Classification ID

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

Related Items (2)

Almost always observable hybrid systems ⋮ Stabilization and control Lyapunov functions for language constrained discrete-time switched linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A structural approach to detectability for a class of hybrid systems
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Controllers for reachability specifications for hybrid systems
• Switching in systems and control
• Bisimilar linear systems.
• Analysis and synthesis of switched linear control systems
• O-minimal hybrid systems.
• Bisimilar control affine systems
• Digital idle speed control of automotive engines: a safety problem for hybrid systems
• Bisimulation relations for dynamical, control, and hybrid systems
• Observability and controllability of piecewise affine and hybrid systems
• Observability and observer-based control of hybrid systems
• Hybrid automata with finite bisimulations
• Computation of Maximal Safe Sets for Switching Systems
• Hybrid Systems: Computation and Control
• Equivalence of switching linear systems by bisimulation

This page was built for publication: Theory and computation of discrete state space decompositions for hybrid systems