Intuitionistic implication makes model checking hard
Martin MundhenkFelix WeissPublished in: Log. Methods Comput. Sci. (2011)
Keyphrases
- model checking
- temporal logic
- formal verification
- temporal properties
- model checker
- automated verification
- formal specification
- finite state
- verification method
- computation tree logic
- timed automata
- process algebra
- symbolic model checking
- partial order reduction
- finite state machines
- theorem prover
- pspace complete
- epistemic logic
- linear temporal logic
- reachability analysis
- formal methods
- concurrent systems
- bounded model checking
- asynchronous circuits
- transition systems
- linear logic
- fuzzy set theory
- coalition logic
- satisfiability problem
- artificial intelligence