Probabilistically Guaranteed Satisfaction of Temporal Logic Constraints During Reinforcement Learning.
Derya AksarayYasin YaziciogluAhmet Semi AsarkayaPublished in: CoRR (2021)
Keyphrases
- temporal logic
- reinforcement learning
- model checking
- automata theoretic
- dynamic constraints
- modal logic
- satisfiability problem
- concurrent systems
- verification method
- mazurkiewicz traces
- dynamic programming
- constraint satisfaction
- transition systems
- computation tree logic
- model checker
- finite state
- linear temporal logic
- bounded model checking
- state space
- formal specification language