Let's Learn Their Language? A Case for Planning with Automata-Network Languages from Model Checking.
Jörg HoffmannHolger HermannsMichaela KlauckMarcel SteinmetzErez KarpasDaniele MagazzeniPublished in: AAAI (2020)
Keyphrases
- model checking
- finite state machines
- temporally extended goals
- temporal logic
- symbolic model checking
- finite state
- timed automata
- model checker
- process algebra
- formal verification
- planning domains
- formal specification
- context free
- temporal properties
- heuristic search
- automated verification
- formal languages
- linear temporal logic
- bounded model checking
- ai planning
- reachability analysis
- pspace complete
- target language
- computation tree logic
- specification language
- concurrent systems
- epistemic logic
- transition systems
- formal methods
- alternating time temporal logic
- asynchronous circuits
- programming language
- reactive systems
- grammatical inference
- pattern languages
- planning problems
- markov chain
- deterministic finite automaton
- natural language
- reinforcement learning