English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Robust, Expressive, and Quantitative Linear Temporal Logics

Neider, D., Weinert, A., & Zimmermann, M. (2019). Robust, Expressive, and Quantitative Linear Temporal Logics. EPTCS 305, 1-16. doi:10.4204/EPTCS.305.1.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/21.11116/0000-0005-DB81-2 Version Permalink: http://hdl.handle.net/21.11116/0000-0005-DB84-F
Genre: Journal Article
Subtitle : Pick any Two for Free

Files

show Files
hide Files
:
arXiv:1909.08538.pdf (Preprint), 269KB
Name:
arXiv:1909.08538.pdf
Description:
File downloaded from arXiv at 2020-03-11 11:37
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Neider, Daniel1, Author              
Weinert, Alexander2, Author
Zimmermann, Martin2, Author
Affiliations:
1Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society, ou_2105292              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: Computer Science, Logic in Computer Science, cs.LO,Computer Science, Formal Languages and Automata Theory, cs.FL
 Abstract: 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.

Details

show
hide
Language(s): eng - English
 Dates: 2019-09-1720192019
 Publication Status: Published in print
 Pages: 16 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: arXiv: 1909.08538
DOI: 10.4204/EPTCS.305.1
URI: http://arxiv.org/abs/1909.08538
BibTex Citekey: NeiderRobust2019
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: EPTCS 305
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1 - 16 Identifier: -