Neider, Daniel und Weinert, Alexander und Zimmermann, Martin (2019) Robust, expressive, and quantitative linear temporal logics: Pick any two for free. In: Electronic Proceedings in Theoretical Computer Science, EPTCS, 305, Seiten 1-16. Tenth International Symposium on Games, Automata, and Formal Verification, 2019-09-02 - 2019-09-03, Bordeaux, Frankreich. doi: 10.4204/EPTCS.305.1.
![]() |
PDF
275kB |
Offizielle URL: https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?GandALF2019.1
Kurzfassung
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.
elib-URL des Eintrags: | https://elib.dlr.de/131253/ | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Dokumentart: | Konferenzbeitrag (Vortrag) | ||||||||||||||||
Titel: | Robust, expressive, and quantitative linear temporal logics: Pick any two for free | ||||||||||||||||
Autoren: |
| ||||||||||||||||
Datum: | 2019 | ||||||||||||||||
Erschienen in: | Electronic Proceedings in Theoretical Computer Science, EPTCS | ||||||||||||||||
Referierte Publikation: | Ja | ||||||||||||||||
Open Access: | Ja | ||||||||||||||||
Gold Open Access: | Nein | ||||||||||||||||
In SCOPUS: | Ja | ||||||||||||||||
In ISI Web of Science: | Nein | ||||||||||||||||
Band: | 305 | ||||||||||||||||
DOI: | 10.4204/EPTCS.305.1 | ||||||||||||||||
Seitenbereich: | Seiten 1-16 | ||||||||||||||||
Name der Reihe: | Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification | ||||||||||||||||
Status: | veröffentlicht | ||||||||||||||||
Stichwörter: | Mathematische Logik, Verifikation | ||||||||||||||||
Veranstaltungstitel: | Tenth International Symposium on Games, Automata, and Formal Verification | ||||||||||||||||
Veranstaltungsort: | Bordeaux, Frankreich | ||||||||||||||||
Veranstaltungsart: | internationale Konferenz | ||||||||||||||||
Veranstaltungsbeginn: | 2 September 2019 | ||||||||||||||||
Veranstaltungsende: | 3 September 2019 | ||||||||||||||||
HGF - Forschungsbereich: | Luftfahrt, Raumfahrt und Verkehr | ||||||||||||||||
HGF - Programm: | Raumfahrt | ||||||||||||||||
HGF - Programmthema: | Technik für Raumfahrtsysteme | ||||||||||||||||
DLR - Schwerpunkt: | Raumfahrt | ||||||||||||||||
DLR - Forschungsgebiet: | R SY - Technik für Raumfahrtsysteme | ||||||||||||||||
DLR - Teilgebiet (Projekt, Vorhaben): | R - Vorhaben SISTEC (alt) | ||||||||||||||||
Standort: | Köln-Porz | ||||||||||||||||
Institute & Einrichtungen: | Institut für Simulations- und Softwaretechnik Institut für Simulations- und Softwaretechnik > Verteilte Systeme und Komponentensoftware | ||||||||||||||||
Hinterlegt von: | Weinert, Alexander | ||||||||||||||||
Hinterlegt am: | 28 Nov 2019 12:08 | ||||||||||||||||
Letzte Änderung: | 24 Apr 2024 20:34 |
Nur für Mitarbeiter des Archivs: Kontrollseite des Eintrags