MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper).
Simon WimmerJohannes HölzlPublished in: ITP (2018)
Keyphrases
- timed automata
- reachability analysis
- model checking
- markov decision processes
- theorem prover
- probabilistic planning
- finite state
- bayesian networks
- first order logic
- theorem proving
- probabilistic model
- probabilistic logic
- optimal policy
- reinforcement learning
- policy iteration
- decision theoretic
- utility function
- uncertain data
- real time
- random variables
- distributed systems
- neural network
- data sets