On Complexity of Model-Checking for the TQL Logic.
Iovka BonevaJean-Marc TalbotPublished in: IFIP TCS (2004)
Keyphrases
- model checking
- pspace complete
- epistemic logic
- model checker
- temporal logic
- bounded model checking
- transition systems
- verification method
- alternating time temporal logic
- asynchronous circuits
- linear temporal logic
- formal verification
- modal logic
- automated verification
- coalition logic
- finite state
- formal specification
- ctl model update
- symbolic model checking
- linear time temporal logic
- finite state machines
- concurrent systems
- computation tree logic
- temporal properties
- computational complexity
- np complete
- formal methods
- reachability analysis
- cl pc
- multi agent systems
- logic programming
- decision problems
- automated reasoning
- knowledge base