Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free

Neider, Daniel, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2019) Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free. .

[img] Text
paper.pdf - OA Published Version

Download (275kB) | Preview


Linear Temporal Logic (LTL) is the standard specification language for reactive systems and is successfully applied in industrial settings. However, many shortcomings of LTL have been identified in the literature, among them the limited expressiveness, the lack of quantitative features, and the inability to express robustness. There is work on overcoming these shortcomings, but each of these is typically addressed in isolation. This is insufficient for applications where all shortcomings manifest themselves simultaneously. Here, we tackle this issue by introducing logics that address more than one shortcoming. To this end, we combine the logics Linear Dynamic Logic, Prompt-LTL, and robust LTL, each addressing one aspect, to new logics. For all combinations of two aspects, the resulting logic has the same desirable algorithmic properties as plain LTL. In particular, the highly efficient algorithmic backends that have been developed for LTL are also applicable to these new logics. Finally, we discuss how to address all three aspects simultaneously.

Item Type: Conference or Workshop Item (Unspecified)
Additional Information: In Proceedings GandALF 2019, arXiv:1909.05979. arXiv admin note: substantial text overlap with arXiv:1808.09028
Uncontrolled Keywords: cs.LO, cs.LO, cs.FL
Depositing User: Symplectic Admin
Date Deposited: 20 Sep 2019 14:22
Last Modified: 02 Aug 2021 07:25
DOI: 10.4204/EPTCS.305.1
Related URLs: