Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.01462 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917423925428224 |
|---|---|
| author | Schewe, Klaus-Dieter Ferrarotti, Flavio Rivière, Peter Singh, Neeraj Kumar Dupont, Guillaume Ameur, Yamine Aït |
| author_facet | Schewe, Klaus-Dieter Ferrarotti, Flavio Rivière, Peter Singh, Neeraj Kumar Dupont, Guillaume Ameur, Yamine Aït |
| contents | The verification of liveness conditions is an important aspect of state-based rigorous methods. This article addresses the extension of the logic of Event-B to a powerful logic, in which properties of traces of an Event-B machine can be expressed. However, all formulae of this logic are still interpreted over states of an Event-B machine rather than traces. The logic exploits that for an Event-B machine $M$ a state $S$ determines all traces of $M$ starting in $S$. We identify a fragment called TREBL of this logic, in which all liveness conditions of interest can be expressed, and define a set of sound derivation rules for the fragment. We further show relative completeness of these derivation rules in the sense that for every valid entailment of a formula $φ$ one can find a derivation, provided the machine $M$ is sufficiently refined. The decisive property is that certain variant terms must be definable in the refined machine. We show that such refinements always exist. Throughout the article several examples from the field of security are used to illustrate the theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_01462 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | TREBL -- A Relative Complete Temporal Event-B Logic. Part I: Theory Schewe, Klaus-Dieter Ferrarotti, Flavio Rivière, Peter Singh, Neeraj Kumar Dupont, Guillaume Ameur, Yamine Aït Logic in Computer Science The verification of liveness conditions is an important aspect of state-based rigorous methods. This article addresses the extension of the logic of Event-B to a powerful logic, in which properties of traces of an Event-B machine can be expressed. However, all formulae of this logic are still interpreted over states of an Event-B machine rather than traces. The logic exploits that for an Event-B machine $M$ a state $S$ determines all traces of $M$ starting in $S$. We identify a fragment called TREBL of this logic, in which all liveness conditions of interest can be expressed, and define a set of sound derivation rules for the fragment. We further show relative completeness of these derivation rules in the sense that for every valid entailment of a formula $φ$ one can find a derivation, provided the machine $M$ is sufficiently refined. The decisive property is that certain variant terms must be definable in the refined machine. We show that such refinements always exist. Throughout the article several examples from the field of security are used to illustrate the theory. |
| title | TREBL -- A Relative Complete Temporal Event-B Logic. Part I: Theory |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2509.01462 |