Efficient mode enumeration of compositional hybrid systems
From MaRDI portal
(Redirected from Efficient mode enumeration of compositional hybrid systems)
Efficient mode enumeration of compositional hybrid systems (scientific article; zbMATH DE number 1956632)
Efficient mode enumeration of compositional hybrid systems (scientific article; zbMATH DE number 1956632)
Recommendations
- Efficient mode enumeration of compositional hybrid systems
- Compositional and uniform modeling of hybrid systems
- Compositional modeling and refinement for hierarchical hybrid systems
- A compositional approach to the verification of hybrid systems
- Formal composition of hybrid systems
- Compositional refinement for hierarchical hybrid systems
- A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems
- Efficient representation and computation of reachable sets for hybrid systems
- Compositionality issues in discrete, continuous, and hybrid systems
- On the composition of hybrid systems
Cited in
(3)
This page was built for publication: Efficient mode enumeration of compositional hybrid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417993)