@InProceedings{artale_et_al:LIPIcs.TIME.2023.2, author = {Artale, Alessandro and Geatti, Luca and Gigante, Nicola and Mazzullo, Andrea and Montanari, Angelo}, title = {{LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa}}, booktitle = {30th International Symposium on Temporal Representation and Reasoning (TIME 2023)}, pages = {2:1--2:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-298-3}, ISSN = {1868-8969}, year = {2023}, volume = {278}, editor = {Artikis, Alexander and Bruse, Florian and Hunsberger, Luke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2023.2}, URN = {urn:nbn:de:0030-drops-190927}, doi = {10.4230/LIPIcs.TIME.2023.2}, annote = {Keywords: Temporal Logic, Succinctness, LTLf, Finite Traces, Pure past LTL} }
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing