DROPS

Document

DOI: 10.4230/LIPIcs.CSL.2016.10

Robust Linear Temporal Logic

Authors: Paulo Tabuada and Daniel Neider

Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)

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.

Cite as

Paulo Tabuada and Daniel Neider. Robust Linear Temporal Logic. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 10:1-10:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{tabuada_et_al:LIPIcs.CSL.2016.10,
  author =	{Tabuada, Paulo and Neider, Daniel},
  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 =	{Talbot, Jean-Marc and Regnier, Laurent},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.10},
  URN =		{urn:nbn:de:0030-drops-65508},
  doi =		{10.4230/LIPIcs.CSL.2016.10},
  annote =	{Keywords: Linear Temporal Logic, Robustness}
}

Search Results

Documents authored by Tabuada, Paulo

Robust Linear Temporal Logic

Abstract

Cite as

Thanks for your feedback!

Could not send message