Satisfiability in Strategy Logic Can Be Easier than Model Checking.
Erman AcarMassimo BenerecettiFabio MogaveroPublished in: AAAI (2019)
Keyphrases
- model checking
- bounded model checking
- temporal logic
- epistemic logic
- model checker
- linear temporal logic
- modal logic
- satisfiability problem
- alternating time temporal logic
- verification method
- transition systems
- formal verification
- asynchronous circuits
- formal specification
- computation tree logic
- finite state
- decision procedures
- automated verification
- coalition logic
- symbolic model checking
- finite state machines
- timed automata
- concurrent systems
- temporal properties
- reachability analysis
- linear time temporal logic
- ctl model update
- cl pc
- modal operators
- description language
- logic programming
- reactive systems
- knowledge representation
- pspace complete
- automated reasoning
- formal methods
- deterministic finite automaton
- phase transition
- np complete