A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
A Verified and Compositional Translation of LTL to Deterministic Rabin Automata
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
doi:10.4230/lipics.itp.2019.11
dblp:conf/itp/0001SS19
fatcat:zhsmqsspyfcd3f4uggptl3t7le