"The Complexity of Generalized Satisfiability for Linear Temporal Logic."

Michael Bauland et al. (2007)
a service of Schloss Dagstuhl - Leibniz Center for Informatics