Time-bounded reachability for monotonic hybrid automata: complexity and fixed points

DOI10.1007/978-3-319-02444-8_6MaRDI QIDQ5166676zbMATH OpenOpenAlexFDO

Authors Thomas Brihaye, Laurent Doyen, G. Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02444-8_6

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

Recommendations

• On reachability for hybrid automata over bounded time
• scientific article; zbMATH DE number 1263213
• What's decidable about hybrid automata?
• scientific article; zbMATH DE number 1444359
• Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable

Cited in

(10)

• Monotonic hybrid systems
• Reachability Problems for Hybrid Automata
• Efficient bounded reachability computation for rectangular automata
• On a simplified untiming procedure for supervisory control of timed automata when the time increases strictly monotonically
• Probabilistic opacity for Markov decision processes
• What's decidable about parametric timed automata?
• Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints
• Formal Modeling and Analysis of Timed Systems
• Parametric updates in parametric timed automata
• The value problem for weighted timed games with two clocks is undecidable

This page was built for publication: Time-bounded reachability for monotonic hybrid automata: complexity and fixed points

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