A Verified and Compositional Translation of LTL to Deterministic Rabin Automata

Julian Brunner, Benedikt Seidl, Salomon Sickert, Michael Wagner
2019 International Conference on Interactive Theorem Proving  
We present a formalisation of the unified translation approach from linear temporal logic (LTL) to ω-automata from [19] . 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
more » ... o 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.
doi:10.4230/lipics.itp.2019.11 dblp:conf/itp/0001SS19 fatcat:zhsmqsspyfcd3f4uggptl3t7le