Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.14581 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910708283736064 |
|---|---|
| author | Amjad, Rayhana van Glabbeek, Rob O'Connor, Liam |
| author_facet | Amjad, Rayhana van Glabbeek, Rob O'Connor, Liam |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_14581 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Semantics for Linear-time Temporal Logic with Finite Observations Amjad, Rayhana van Glabbeek, Rob O'Connor, Liam Logic in Computer Science 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. |
| title | Semantics for Linear-time Temporal Logic with Finite Observations |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2411.14581 |