Satisfiability of CTL* with Constraints.

Claudia Carapelle Alexander Kartzow Markus Lohrey

Published in: CONCUR (2013)

Keyphrases

temporal logic
automata theoretic
model checking
satisfiability problem
phase transition
global constraints
sat encodings
computational complexity
np complete
constraint satisfaction
propositional logic
constrained optimization
sat problem
decision procedures
bounded model checking