Login / Signup
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
Thomas Brihaye
Laurent Doyen
Gilles Geeraerts
Joël Ouaknine
Jean-François Raskin
James Worrell
Published in:
CoRR (2012)
Keyphrases
</>
hybrid automata
logic programs
computational complexity
worst case
finite state automata
data management
decision problems