The complexity of model checking concurrent programs against CTLK specifications.
Alessio LomuscioFranco RaimondiPublished in: AAMAS (2006)
Keyphrases
- model checking
- process algebra
- concurrent programs
- formal specification
- pspace complete
- model checker
- concurrent systems
- automated verification
- bounded model checking
- temporal logic
- transition systems
- asynchronous circuits
- formal verification
- finite state machines
- reactive systems
- formal methods
- symbolic model checking
- temporal properties
- epistemic logic
- specification language
- computation tree logic
- timed automata
- verification method
- petri net
- communication protocols
- np complete
- knowledge based systems
- general purpose