Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2016.10
URN: urn:nbn:de:0030-drops-65508
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6550/
Tabuada, Paulo ; Neider, Daniel
Robust Linear Temporal Logic
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{tabuada_et_al:LIPIcs:2016:6550,
author = {Paulo Tabuada and Daniel Neider},
title = {{Robust Linear Temporal Logic}},
booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
pages = {10:1--10:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-022-4},
ISSN = {1868-8969},
year = {2016},
volume = {62},
editor = {Jean-Marc Talbot and Laurent Regnier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6550},
URN = {urn:nbn:de:0030-drops-65508},
doi = {10.4230/LIPIcs.CSL.2016.10},
annote = {Keywords: Linear Temporal Logic, Robustness}
}
| Keywords: | Linear Temporal Logic, Robustness | |
| Seminar: | 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 29.08.2016 |
