Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints

DOI10.1007/978-3-319-10512-3_14zbMATH Open1448.68274OpenAlexW1903063254MaRDI QIDQ5500564FDOQ5500564

Authors: Nima Roohi, Mahesh Viswanathan 

Publication date: 6 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10512-3_14

Recommendations

• On reachability for hybrid automata over bounded time
• Time-bounded reachability for monotonic hybrid automata: complexity and fixed points
• Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
• Reachability and optimal control for linear hybrid automata: a quantifier elimination approach
• scientific article; zbMATH DE number 1444359
• Reachability in timed automata with diagonal constraints
• Hybrid Systems: Computation and Control
• The Discrete Time Behaviour of Restricted Linear Hybrid Automata
• Tightened reachability constraints for the verification of linear hybrid systems
• Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Ordinary differential inclusions (34A60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cited In (3)

• Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata
• On reachability for hybrid automata over bounded time
• The Discrete Time Behaviour of Restricted Linear Hybrid Automata

This page was built for publication: Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints

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