Finite-trace linear temporal logic: coinductive completeness

Linear temporal logic (LTL) is suitable not only for infinite-trace systems, but also for finite-trace systems. In particular, LTL with finite-trace semantics is frequently used as a specification formalism in runtime verification, in artificial intelligence, and in business process modeling. The sa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Formal methods in system design Jg. 53; H. 1; S. 138 - 163
1. Verfasser: Roşu, Grigore
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.08.2018
Springer Nature B.V
Schlagworte:
Axioms
CAE) and Design
Circuits and Systems
Computer-Aided Engineering (CAD
Decision theory
Electrical Engineering
Engineering
Semantics
Software Engineering/Programming and Operating Systems
Temporal logic
Coinduction
Complete deduction
Linear temporal logic
Satisfiability
ISSN:0925-9856, 1572-8102
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Linear temporal logic (LTL) is suitable not only for infinite-trace systems, but also for finite-trace systems. In particular, LTL with finite-trace semantics is frequently used as a specification formalism in runtime verification, in artificial intelligence, and in business process modeling. The satisfiability of LTL with finite-trace semantics, a known PSPACE-complete problem, has been recently studied and both indirect and direct decision procedures have been proposed. However, the proof theory of LTL with finite traces is not that well understood. Specifically, complete proof systems of LTL with only infinite or with both infinite and finite traces have been proposed in the literature, but complete proof systems directly for LTL with only finite traces are missing. The only known results are indirect, by translation to other logics, e.g., infinite-trace LTL. This paper proposes a direct sound and complete proof system for finite-trace LTL. The axioms and proof rules are natural and expected, except for one rule of coinductive nature, reminiscent of the Gödel–Löb axiom.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-9856
1572-8102
DOI:10.1007/s10703-018-0321-3