Complexity of ITL model checking: some well-behaved fragments of the interval logic HS.
Alberto MolinariAngelo MontanariAdriano PeronPublished in: CoRR (2016)
Keyphrases
- model checking
- pspace complete
- model checker
- epistemic logic
- temporal logic
- bounded model checking
- alternating time temporal logic
- transition systems
- verification method
- linear temporal logic
- asynchronous circuits
- formal verification
- modal logic
- linear time temporal logic
- coalition logic
- temporal properties
- automated verification
- formal specification
- finite state machines
- ctl model update
- computation tree logic
- finite state
- symbolic model checking
- formal methods
- reachability analysis
- process algebra
- np complete
- concurrent systems
- timed automata
- computational complexity
- cl pc
- decision problems
- satisfiability problem
- binary decision diagrams
- heuristic search
- description logics