Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata

DOI10.1145/1967701.1967719zbMath1362.68144OpenAlexW2053863894MaRDI QIDQ2986719

Sayan Mitra, Kyoung-Dae Kim, P. R. Kumar

Publication date: 16 May 2017

Published in: Proceedings of the 14th international conference on Hybrid systems: computation and control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1967701.1967719

zbMATH Keywords

reachabilitylinear hybrid automatadeterministic discrete transitiontransversal discrete transition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (2)

Finite data-rate feedback stabilization of switched and hybrid linear systems ⋮ Abstractions Refinement for Hybrid Systems Diagnosability Analysis

This page was built for publication: Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata