Generation of the path to counter-examples by backward state space traversal in symbolic model checking based on term rewriting.
Mihai Lica PuraLuciana MoroganDidier BuchsPublished in: COMM (2016)
Keyphrases
- term rewriting
- counter examples
- symbolic model checking
- state space
- conformant planning
- forward search
- model checking
- partial observability
- theorem proving
- theorem prover
- heuristic search
- planning problems
- operational semantics
- formal verification
- reinforcement learning
- partially observable
- dynamical systems
- orders of magnitude
- symbolic representation
- optimal policy
- binary decision diagrams
- belief space
- state variables
- belief state
- model checker
- reinforcement learning algorithms
- search space
- logic programs
- markov decision processes
- relational databases
- dynamic programming
- markov decision process
- temporal logic
- initial state
- data structure
- machine learning