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 o...
Abstract. This is a brief summary of the invited lecture delivered during the conference. The interested reader is referred to [2] for more information.