Published in: LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)
Shaun Azzopardi, David Lidell, and Nir Piterman. A Direct Translation from LTL with Past to Deterministic Rabin Automata. In 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 306, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{azzopardi_et_al:LIPIcs.MFCS.2024.13, author = {Azzopardi, Shaun and Lidell, David and Piterman, Nir}, title = {{A Direct Translation from LTL with Past to Deterministic Rabin Automata}}, booktitle = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-335-5}, ISSN = {1868-8969}, year = {2024}, volume = {306}, editor = {Kr\'{a}lovi\v{c}, Rastislav and Ku\v{c}era, Anton{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.13}, URN = {urn:nbn:de:0030-drops-205694}, doi = {10.4230/LIPIcs.MFCS.2024.13}, annote = {Keywords: Linear temporal logic, \omega-automata, determinization} }
Published in: LIPIcs, Volume 278, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023)
Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, and Angelo Montanari. LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa. In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 2:1-2:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 278, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023)
Luca Geatti, Alessandro Gianola, and Nicola Gigante. Torwards Infinite-State Verification and Planning with Linear Temporal Logic Modulo Theories (Extended Abstract). In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 21:1-21:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{geatti_et_al:LIPIcs.TIME.2023.21, author = {Geatti, Luca and Gianola, Alessandro and Gigante, Nicola}, title = {{Torwards Infinite-State Verification and Planning with Linear Temporal Logic Modulo Theories}}, booktitle = {30th International Symposium on Temporal Representation and Reasoning (TIME 2023)}, pages = {21:1--21:3}, 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.21}, URN = {urn:nbn:de:0030-drops-191110}, doi = {10.4230/LIPIcs.TIME.2023.21}, annote = {Keywords: Linear Temporal Logic, Satisfiability Modulo Theories} }
Published in: LIPIcs, Volume 278, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023)
Renato Acampora, Luca Geatti, Nicola Gigante, and Angelo Montanari. Qualitative past Timeline-Based Games (Extended Abstract). In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 22:1-22:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{acampora_et_al:LIPIcs.TIME.2023.22, author = {Acampora, Renato and Geatti, Luca and Gigante, Nicola and Montanari, Angelo}, title = {{Qualitative past Timeline-Based Games}}, booktitle = {30th International Symposium on Temporal Representation and Reasoning (TIME 2023)}, pages = {22:1--22:3}, 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.22}, URN = {urn:nbn:de:0030-drops-191125}, doi = {10.4230/LIPIcs.TIME.2023.22}, annote = {Keywords: Automata, Planning, Temporal Reasoning} }
Published in: LIPIcs, Volume 206, 28th International Symposium on Temporal Representation and Reasoning (TIME 2021)
Luca Geatti, Nicola Gigante, Angelo Montanari, and Gabriele Venturato. Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker. In 28th International Symposium on Temporal Representation and Reasoning (TIME 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 206, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{geatti_et_al:LIPIcs.TIME.2021.8, author = {Geatti, Luca and Gigante, Nicola and Montanari, Angelo and Venturato, Gabriele}, title = {{Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker}}, booktitle = {28th International Symposium on Temporal Representation and Reasoning (TIME 2021)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-206-8}, ISSN = {1868-8969}, year = {2021}, volume = {206}, editor = {Combi, Carlo and Eder, Johann and Reynolds, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2021.8}, URN = {urn:nbn:de:0030-drops-147846}, doi = {10.4230/LIPIcs.TIME.2021.8}, annote = {Keywords: SAT, LTL, LTL+Past, Tableaux} }
Feedback for Dagstuhl Publishing