Published in: LIPIcs, Volume 278, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023)
Laura Nenzi. Learning Temporal Logic Formulas from Time-Series Data (Invited Talk). In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 1:1-1:2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{nenzi:LIPIcs.TIME.2023.1, author = {Nenzi, Laura}, title = {{Learning Temporal Logic Formulas from Time-Series Data}}, booktitle = {30th International Symposium on Temporal Representation and Reasoning (TIME 2023)}, pages = {1:1--1:2}, 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.1}, URN = {urn:nbn:de:0030-drops-190917}, doi = {10.4230/LIPIcs.TIME.2023.1}, annote = {Keywords: Temporal Logic, Mining Specifications} }
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 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, and James Worrell. Skolem Meets Schanuel. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 20:1-20:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bilu_et_al:LIPIcs.MFCS.2022.20, author = {Bilu, Yuri and Luca, Florian and Nieuwveld, Joris and Ouaknine, Jo\"{e}l and Purser, David and Worrell, James}, title = {{Skolem Meets Schanuel}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {20:1--20:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.20}, URN = {urn:nbn:de:0030-drops-168180}, doi = {10.4230/LIPIcs.MFCS.2022.20}, annote = {Keywords: Skolem Problem, Skolem Conjecture, Exponential Local-Global Principle, p-adic Schanuel Conjecture} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
George Kenison. On the Skolem Problem for Reversible Sequences. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 61:1-61:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kenison:LIPIcs.MFCS.2022.61, author = {Kenison, George}, title = {{On the Skolem Problem for Reversible Sequences}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {61:1--61:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.61}, URN = {urn:nbn:de:0030-drops-168590}, doi = {10.4230/LIPIcs.MFCS.2022.61}, annote = {Keywords: The Skolem Problem, Linear Recurrences, Verification} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Florian Luca, Joël Ouaknine, and James Worrell. A Universal Skolem Set of Positive Lower Density. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 73:1-73:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{luca_et_al:LIPIcs.MFCS.2022.73, author = {Luca, Florian and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{A Universal Skolem Set of Positive Lower Density}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {73:1--73:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.73}, URN = {urn:nbn:de:0030-drops-168711}, doi = {10.4230/LIPIcs.MFCS.2022.73}, annote = {Keywords: Linear Recurrence Sequences, Skolem Problem, Exponential Diophantine Equations, Sieve Methods} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, and James Worrell. On Positivity and Minimality for Second-Order Holonomic Sequences. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 67:1-67:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{kenison_et_al:LIPIcs.MFCS.2021.67, author = {Kenison, George and Klurman, Oleksiy and Lefaucheux, Engel and Luca, Florian and Moree, Pieter and Ouaknine, Jo\"{e}l and Whiteland, Markus A. and Worrell, James}, title = {{On Positivity and Minimality for Second-Order Holonomic Sequences}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {67:1--67:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.67}, URN = {urn:nbn:de:0030-drops-145071}, doi = {10.4230/LIPIcs.MFCS.2021.67}, annote = {Keywords: Holonomic sequences, Minimal solutions, Positivity Problem} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, and James Worrell. The Orbit Problem for Parametric Linear Dynamical Systems. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 28:1-28:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{baier_et_al:LIPIcs.CONCUR.2021.28, author = {Baier, Christel and Funke, Florian and Jantsch, Simon and Karimov, Toghrul and Lefaucheux, Engel and Luca, Florian and Ouaknine, Jo\"{e}l and Purser, David and Whiteland, Markus A. and Worrell, James}, title = {{The Orbit Problem for Parametric Linear Dynamical Systems}}, booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-203-7}, ISSN = {1868-8969}, year = {2021}, volume = {203}, editor = {Haddad, Serge and Varacca, Daniele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.28}, URN = {urn:nbn:de:0030-drops-144053}, doi = {10.4230/LIPIcs.CONCUR.2021.28}, annote = {Keywords: Orbit problem, parametric, linear dynamical systems} }
Published in: OASIcs, Volume 63, 18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018)
Fabrice Guet, Luca Santinelli, Jérôme Morio, Guillaume Phavorin, and Eric Jenn. Toward Contention Analysis for Parallel Executing Real-Time Tasks. In 18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018). Open Access Series in Informatics (OASIcs), Volume 63, pp. 4:1-4:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{guet_et_al:OASIcs.WCET.2018.4, author = {Guet, Fabrice and Santinelli, Luca and Morio, J\'{e}r\^{o}me and Phavorin, Guillaume and Jenn, Eric}, title = {{Toward Contention Analysis for Parallel Executing Real-Time Tasks}}, booktitle = {18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018)}, pages = {4:1--4:13}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-073-6}, ISSN = {2190-6807}, year = {2018}, volume = {63}, editor = {Brandner, Florian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2018.4}, URN = {urn:nbn:de:0030-drops-97506}, doi = {10.4230/OASIcs.WCET.2018.4}, annote = {Keywords: Contention analysis, parallel executions, measurement-based probabilistic timing analysis, probabilistic worst-case execution time} }
Published in: Dagstuhl Seminar Proceedings, Volume 10271, Verification over discrete-continuous boundaries (2010)
Erika Abraham, Florian Corzilius, Ulrich Loup, and Thomas Sturm. A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra. In Verification over discrete-continuous boundaries. Dagstuhl Seminar Proceedings, Volume 10271, pp. 1-9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{abraham_et_al:DagSemProc.10271.2, author = {Abraham, Erika and Corzilius, Florian and Loup, Ulrich and Sturm, Thomas}, title = {{A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra}}, booktitle = {Verification over discrete-continuous boundaries}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10271}, editor = {Bernd Becker and Luca Cardelli and Holger Hermanns and Sofiene Tahar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10271.2}, URN = {urn:nbn:de:0030-drops-27907}, doi = {10.4230/DagSemProc.10271.2}, annote = {Keywords: SMT-solving, Real Algebra, Hybrid Systems, Verification, Synthesis} }
Published in: Dagstuhl Seminar Proceedings, Volume 10271, Verification over discrete-continuous boundaries (2010)
Florian Schupfer and Christoph Grimm. Towards more Dependable Verification of Mixed-Signal Systems. In Verification over discrete-continuous boundaries. Dagstuhl Seminar Proceedings, Volume 10271, pp. 1-13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{schupfer_et_al:DagSemProc.10271.4, author = {Schupfer, Florian and Grimm, Christoph}, title = {{Towards more Dependable Verification of Mixed-Signal Systems}}, booktitle = {Verification over discrete-continuous boundaries}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10271}, editor = {Bernd Becker and Luca Cardelli and Holger Hermanns and Sofiene Tahar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10271.4}, URN = {urn:nbn:de:0030-drops-27911}, doi = {10.4230/DagSemProc.10271.4}, annote = {Keywords: Affine Arithmetic, Range based methods, Verification, Semi-symbolic simulation} }
Feedback for Dagstuhl Publishing