The descriptive complexity of modal mu model-checking parity games.
Karoliina LehtinenPublished in: GandALF (2017)
Keyphrases
- model checking
- pspace complete
- temporal logic
- transition systems
- modal logic
- temporal properties
- automated verification
- formal specification
- symbolic model checking
- formal verification
- model checker
- epistemic logic
- partial order reduction
- bounded model checking
- reachability analysis
- timed automata
- verification method
- computation tree logic
- np complete
- concurrent systems
- finite state
- formal methods
- cl pc
- process algebra
- asynchronous circuits
- video games
- finite state machines
- decision problems
- computer games
- reactive systems
- linear temporal logic
- knowledge based systems
- computational complexity
- game theoretic
- satisfiability problem
- alternating time temporal logic
- knowledge base