Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.
Yasir MahmoodArne MeierPublished in: FoIKS (2020)
Keyphrases
- model checking
- pspace complete
- cl pc
- bounded model checking
- satisfiability problem
- coalition logic
- temporal logic
- model checker
- np complete
- epistemic logic
- modal logic
- alternating time temporal logic
- propositional logic
- transition systems
- formal verification
- linear temporal logic
- verification method
- asynchronous circuits
- symbolic model checking
- computational complexity
- formal specification
- temporal properties
- decision procedures
- propositional theories
- computation tree logic
- propositional formulas
- automated verification
- ctl model update
- timed automata
- linear time temporal logic
- sat problem
- decision problems
- search algorithm
- cnf formula
- formal methods
- boolean formula
- conjunctive normal form
- logical framework
- probabilistic logic
- phase transition
- first order logic
- reactive systems
- causal graph
- deterministic finite automaton
- logic programming
- multi agent systems