Linear Temporal Logic and Linear Dynamic Logic on Finite Traces
Author
De Giacomo, Giuseppe; Vardi, Moshe Y.
Date
2013Abstract
In this paper we look into the assumption of interpreting LTL over finite traces. In particular we show that LTLf, i.e., LTL under this assumption, is less expressive than what might appear at first sight, and that at essentially no computational cost one can make a significant increase in expressiveness while maintaining the same intuitiveness of LTLf. Indeed, we propose a logic, LDLf for Linear Dynamic Logic over finite traces, which borrows the syntax from Propositional Dynamic Logic (PDL), but is interpreted over finite traces. Satisfiability, validity and logical implication (as well as model checking) for LTLf. are PSPACE-complete as for LTLf. (and LTL).
Citation
Type
Conference paper
Publisher
Citable link to this page
https://hdl.handle.net/1911/78495Rights
This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by the Association for Computing Machinery.Metadata
Show full item recordCollections
- Computer Science Publications [134]
- Faculty Publications [4990]