Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past
Work
Year: 2002
Type: article
Abstract: We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (PLTL). More precisely, we consider several fragments of PLTL. depending on the allowed set of ... more
Author Nicolas Markey
Cites: 39
Cited by: 7
Related to: 10
FWCI: 1.048
Citation percentile (by year/subfield): 67.66
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: gold