A complete characterization of the ordering of path-complete methods
DOI10.1145/3302504.3311803OpenAlexW2937722039MaRDI QIDQ5239229FDOQ5239229
Authors: Matthew Philippe, Raphaël M. Jungers 
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)
Cited In (4)
- The computability path ordering
- Characterization of the ordering of path-complete stability certificates with addition-closed templates
- Comparison of path-complete Lyapunov functions via template-dependent lifts
- Necessary and Sufficient Conditions for Template-Dependent Ordering of Path-Complete Lyapunov Methods
This page was built for publication: A complete characterization of the ordering of path-complete methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239229)
