文章基本信息

标题：A Verified and Compositional Translation of LTL to Deterministic Rabin Automata
本地全文：下载
作者：Julian Brunner ; Benedikt Seidl ; Salomon Sickert 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：141
页码：1-19
DOI：10.4230/LIPIcs.ITP.2019.11
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Automata Theory; Automata over Infinite Words; Deterministic Automata; Linear Temporal Logic; Model Checking; Verified Algorithms