Near Optimal Task Graph Scheduling with Priced Timed Automata and Priced Timed Markov Decision Processes.
Anne EjsingMartin JensenMarco MuñizJacob NørhaveLars RechterPublished in: CoRR (2020)
Keyphrases
- timed automata
- reachability analysis
- markov decision processes
- model checking
- theorem prover
- finite state
- temporal logic
- first order logic
- theorem proving
- real time systems
- transition matrices
- average cost
- optimal policy
- infinite horizon
- reinforcement learning
- petri net
- random walk
- state space
- average reward
- planning under uncertainty
- dynamic programming
- state and action spaces
- objective function