2026-07-23T00:22:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6550 2024-03-06T10:38:42Z ddc:004 open_access

Robust Linear Temporal Logic Tabuada, Paulo Neider, Daniel Linear Temporal Logic Robustness Although it is widely accepted that every system should be robust, in the sense that "small" violations of environment assumptions should lead to "small" violations of system guarantees, it is less clear how to make this intuitive notion of robustness mathematically precise. In this paper, we address the problem of how to specify robustness in temporal logic. Our solution consists of a robust version of the Linear Temporal Logic (LTL) fragment that only contains the always and eventually temporal operators. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Paulo Tabuada and Daniel Neider 2016 Is Part Of LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2016.10 urn:nbn:de:0030-drops-65508 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.10 eng https://creativecommons.org/licenses/by/3.0/legalcode