Semantics for Linear-time Temporal Logic with Finite Observations

Abstract: LTL3 is a multi-valued variant of Linear-time Temporal Logic for runtime verification applications. The semantic descriptions of LTL3 in previous work are given only in terms of the relationship to conventional LTL. Our approach, by contrast, gives a full model-based inductive accounting of the semantics of LTL3, in terms of families of definitive prefix sets. We show that our definitive prefix sets are isomorphic to linear-time temporal properties (sets of infinite traces), and thereby show that our semantics of LTL3 directly correspond to the semantics of conventional LTL. In addition, we formalise the formula progression evaluation technique, popularly used in runtime verification and testing contexts, and show its soundness and completeness up to finite traces with respect to our semantics. All of our definitions and proofs are mechanised in Isabelle/HOL.

• The paper introduces an inductive semantics for LTL3 by leveraging definitive prefixes, bridging the gap between traditional infinite-trace LTL and finite observations.
• The authors establish the soundness and completeness of their model through mechanized proofs in Isabelle/HOL, ensuring rigorous verification.
• The findings enhance runtime verification by providing a structured framework to analyze multi-valued temporal properties in practical settings.

Semantics for Linear-time Temporal Logic with Finite Observations

This paper presents a novel insight into Linear-time Temporal Logic (LTL) by introducing a detailed and formal model-based semantics for LTL$_3$, a three-valued variant of LTL, whose utility lies prominently in the domain of runtime verification. The prevailing semantic treatment of LTL$_3$ has been primarily through its relationship to the traditional LTL, lacking an inductive semantics framework. The central contribution of the paper is to bridge this gap by offering a semantics based on definitive prefixes, refining our understanding of LTL$_3$ by situating it within the broader universe of LTL.

LTL, a logic commonly deployed for specifying the behavior of reactive systems, is traditionally interpreted over infinite traces. While this is well suited for theoretical descriptions, practical applications, such as runtime verification, require handling finite observations, thus prompting interest in LTL variants like LTL$_3$. This variant distinguishes between properties that are definitively true, definitively false, and those that remain indeterminate when observed over finite executions. The paper addresses previous assertions in the literature that LTL$_3$ cannot possess an inductive semantics by providing a counterexample through a compositional semantics based on families of definitive prefix sets.

The findings in the paper establish that definitive prefix sets are isomorphic to linear-time temporal properties, thus showing that traditional LTL's semantics can naturally extend to those of LTL$_3$. The authors introduce a transformation technique grounded in logical formula progression, a popular approach used in runtime monitoring and depict its soundness and completeness concerning their proposed semantics.

Notably, all definitions and proofs are meticulously verified through mechanization in Isabelle/HOL, enhancing the reliability and reproducibility of the results. This mechanized approach applies to over 1700 lines of proof script, underscoring the rigor behind the formal verification of the proposed semantics.

The implications of this work are manifold. Practically, the results can significantly impact verification toolchains by providing a structured framework for evaluating system properties under finite observations. Theoretically, establishing the isomorphism between definitive prefix sets and LTL properties enriches our comprehension of how multi-valued logics interact with linear-time temporal reasoning. This foundational work for LTL$_3$ opens the possibility of extending these principles to other temporal logics such as RV-LTL and rLTL, or extending to probabilistic scenarios where answers are not definitively boolean but carry associated certainty measures.

In conclusion, the authors' exploration of the semantics for LTL$_3$ formalizes and expands its conceptual underpinnings, paving the way for future explorations in the scope of multi-valued temporal logics. Researchers looking to extend or utilize LTL variants in runtime verification stand to benefit greatly from the insights and methodologies articulated in this paper.