The Complexity of Generalized Satisfiability for Linear Temporal Logic

Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. The Complexity of Generalized Satisfiability for Linear Temporal Logic. In Helmut Seidl, editor, Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings. Volume 4423 of Lecture Notes in Computer Science, pages 48-62, Springer, 2007. [doi]

Abstract

Abstract is missing.