A complete characterization of the ordering of path-complete methods
From MaRDI portal
Publication:5239229
DOI10.1145/3302504.3311803OpenAlexW2937722039MaRDI QIDQ5239229
Raphaël M. Jungers, Matthew Philippe
Publication date: 22 October 2019
Published in: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3302504.3311803
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items (3)
Necessary and Sufficient Conditions for Template-Dependent Ordering of Path-Complete Lyapunov Methods ⋮ Characterization of the ordering of path-complete stability certificates with addition-closed templates ⋮ Comparison of path-complete Lyapunov functions via template-dependent lifts
This page was built for publication: A complete characterization of the ordering of path-complete methods
