Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL.
Catalin DimaPublished in: TIME (2009)
Keyphrases
- positive and negative
- computation tree logic
- model checking
- timed automata
- partial order reduction
- temporal logic
- finite state machines
- epistemic logic
- bounded model checking
- formal specification
- temporal properties
- positive or negative
- symbolic model checking
- model checker
- finite state
- decision rules
- verification method
- formal verification
- automated verification
- temporal epistemic
- pspace complete
- linear temporal logic
- formal methods
- transition systems
- deterministic finite automaton
- concurrent systems
- description logics
- petri net