2026-07-23T07:58:23Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:11066 2024-03-06T10:47:17Z ddc:004 open_access

A Verified and Compositional Translation of LTL to Deterministic Rabin Automata Brunner, Julian Seidl, Benedikt Sickert, Salomon Automata Theory Automata over Infinite Words Deterministic Automata Linear Temporal Logic Model Checking Verified Algorithms We present a formalisation of the unified translation approach from linear temporal logic (LTL) to omega-automata from [Javier Esparza et al., 2018]. This approach decomposes LTL formulas into "simple" languages and allows a clear separation of concerns: first, we formalise the purely logical result yielding this decomposition; second, we develop a generic, executable, and expressive automata library providing necessary operations on automata to re-combine the "simple" languages; third, we instantiate this generic theory to obtain a construction for deterministic Rabin automata (DRA). We extract from this particular instantiation an executable tool translating LTL to DRAs. To the best of our knowledge this is the first verified translation of LTL to DRAs that is proven to be double-exponential in the worst case which asymptotically matches the known lower bound. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Julian Brunner and Benedikt Seidl and Salomon Sickert 2019 Is Part Of LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITP.2019.11 urn:nbn:de:0030-drops-110664 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.11 eng https://creativecommons.org/licenses/by/3.0/legalcode