Theory and computation of discrete state space decompositions for hybrid systems

DOI10.1016/J.EJCON.2012.09.001zbMATH Open1293.93129OpenAlexW2085444703MaRDI QIDQ397399FDOQ397399

Authors Maria D. 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)

Recommendations

• scientific article; zbMATH DE number 1301620
• Hybrid automata with finite bisimulations
• Verification and Control of Hybrid Systems
• scientific article; zbMATH DE number 1303067
• Abstractions of hybrid systems for verification

Cites Work

• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1301620 (Why is no real title available?)
• scientific article; zbMATH DE number 1956652 (Why is no real title available?)
• scientific article; zbMATH DE number 2085317 (Why is no real title available?)
• scientific article; zbMATH DE number 2085342 (Why is no real title available?)
• A structural approach to detectability for a class of hybrid systems
• Analysis and synthesis of switched linear control systems
• Bisimilar control affine systems
• Bisimilar linear systems.
• Bisimulation relations for dynamical, control, and hybrid systems
• Computation of Maximal Safe Sets for Switching Systems
• Controllers for reachability specifications for hybrid systems
• Digital idle speed control of automotive engines: a safety problem for hybrid systems
• Editorial: Observability and observer-based control of hybrid systems
• Equivalence of switching linear systems by bisimulation
• Hybrid Systems: Computation and Control
• Hybrid automata with finite bisimulations
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• O-minimal hybrid systems.
• Observability and controllability of piecewise affine and hybrid systems
• Switching in systems and control

Cited In (3)

• State space and binary decision diagram models for discrete standby systems with multistate components
• Stabilization and control Lyapunov functions for language constrained discrete-time switched linear systems
• Almost always observable hybrid systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397399)