Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points

DOI10.1007/978-3-319-02444-8_6zbMath1410.68198OpenAlexW1480878841MaRDI QIDQ5166676

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

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

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

Related Items (3)

Parametric updates in parametric timed automata ⋮ Probabilistic opacity for Markov decision processes ⋮ What’s Decidable About Parametric Timed Automata?

This page was built for publication: Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points