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

Michael Bauland et al. (2006)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-09-28

a service of  Schloss Dagstuhl - Leibniz Center for Informatics