Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.
Thomas BrihayeLaurent DoyenGilles GeeraertsJoël OuaknineJean-François RaskinJames WorrellPublished in: ATVA (2013)
Keyphrases
- fixed point
- hybrid automata
- linear logic
- dynamical systems
- approximate value iteration
- sufficient conditions
- computational complexity
- worst case
- belief propagation
- asymptotic properties
- temporal difference learning
- finite state automata
- decision problems
- probabilistic model
- message passing
- free energy
- reinforcement learning
- bayesian networks