Trace semantics and refinement patterns for real-time properties in event-B models
Trace semantics and refinement patterns for real-time properties in event-B models
Event-B is a formal method that utilizes a stepwise development approach for system-level modeling and analysis. We are interested in reasoning about real-time deadlines and delays between trigger and response events. There is existing work on treating these properties in Event-B but it lacks a semantic treatment in terms of trace behaviors. Because timing properties require fairness assumptions, we use infinite traces and develop conditions under which all infinite traces of a machine satisfy trigger-response and timing properties. We present refinement semantics of models whose behavior traces are infinite. In addition, we generalize our previous work by allowing a relation between concrete states and abstract states to simulate infinite state traces. Forward simulation, which is a proof technique for refinement, has been used to verify the consistency between different refinement levels regarding finite traces. Based on forward simulation, fairness assumptions, relative deadlock freedom, and conditional convergence are adopted as additional conditions that guarantee infinite trace refinement of timed models. The bounded retransmission protocol is used to illustrate the required proof obligations for timed traces.
Zhu, Chenyang
67a1c085-5e0b-4dcf-8770-b99c520115fc
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Zhu, Chenyang
67a1c085-5e0b-4dcf-8770-b99c520115fc
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Zhu, Chenyang, Butler, Michael and Cirstea, Corina
(2020)
Trace semantics and refinement patterns for real-time properties in event-B models.
Science of Computer Programming, 197, [102513].
(doi:10.1016/j.scico.2020.102513).
Abstract
Event-B is a formal method that utilizes a stepwise development approach for system-level modeling and analysis. We are interested in reasoning about real-time deadlines and delays between trigger and response events. There is existing work on treating these properties in Event-B but it lacks a semantic treatment in terms of trace behaviors. Because timing properties require fairness assumptions, we use infinite traces and develop conditions under which all infinite traces of a machine satisfy trigger-response and timing properties. We present refinement semantics of models whose behavior traces are infinite. In addition, we generalize our previous work by allowing a relation between concrete states and abstract states to simulate infinite state traces. Forward simulation, which is a proof technique for refinement, has been used to verify the consistency between different refinement levels regarding finite traces. Based on forward simulation, fairness assumptions, relative deadlock freedom, and conditional convergence are adopted as additional conditions that guarantee infinite trace refinement of timed models. The bounded retransmission protocol is used to illustrate the required proof obligations for timed traces.
Text
scp2020
- Accepted Manuscript
Restricted to Repository staff only until 23 June 2022.
Request a copy
More information
Accepted/In Press date: 17 June 2020
e-pub ahead of print date: 23 June 2020
Identifiers
Local EPrints ID: 442319
URI: http://eprints.soton.ac.uk/id/eprint/442319
ISSN: 0167-6423
PURE UUID: dccf969b-ba9d-4b9b-8d78-cd29473160ce
Catalogue record
Date deposited: 13 Jul 2020 16:31
Last modified: 07 Oct 2020 01:38
Export record
Altmetrics
Contributors
Author:
Chenyang Zhu
Author:
Michael Butler
Author:
Corina Cirstea
University divisions
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics