Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata.
Pedro R. D'ArgenioArnd HartmannsAxel LegaySean SedwardsPublished in: IFM (2016)
Keyphrases
- timed automata
- closed form
- data driven
- model checking
- dynamic programming
- optimal solution
- information theoretic
- artificial intelligence
- error tolerance
- probabilistic model
- worst case
- approximation methods
- generative model
- real time
- theorem prover
- grid computing
- efficient computation
- approximation error
- machine learning