Reasoning About Real-Time Systems in Event-B Models with Fairness Assumptions
Reasoning About Real-Time Systems in Event-B Models with Fairness Assumptions
Stepwise-based development supported by the Event-B formalism has been used in the domain of system design and verification. This refinement approach guarantees that safety properties are preserved, while additional reasoning is required to prove liveness properties. Our previous work proposes to use real-time trigger-response properties to reason about liveness properties and timed properties in real-time systems. Conditions such as weak fairness assumptions, relative deadlock freedom, and conditional convergence are explored to eliminate Zeno behavior when modeling real-time systems. In this reasoning framework, the response events are required not to be disabled by other events. This paper extends our previous results by using strong fairness assumptions to relax the constraints on response events. Refinement rules and strategies are also developed to refine real-time systems in the form of trace semantics and LTL operators with fairness assumptions. A simplified bounded re-transmission protocol case study is used to illustrate the approach.
Zhu, Chenyang
bb823fac-bd18-42a3-9720-6188fe84aca6
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Hoang, Thai Son
dcc0431d-2847-4e1d-9a85-54e4d6bab43f
Zhu, Chenyang
bb823fac-bd18-42a3-9720-6188fe84aca6
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Hoang, Thai Son
dcc0431d-2847-4e1d-9a85-54e4d6bab43f
Zhu, Chenyang, Butler, Michael, Cirstea, Corina and Hoang, Thai Son
(2021)
Reasoning About Real-Time Systems in Event-B Models with Fairness Assumptions.
In Proceedings of TASE2021 Conference.
(In Press)
Record type:
Conference or Workshop Item
(Paper)
Abstract
Stepwise-based development supported by the Event-B formalism has been used in the domain of system design and verification. This refinement approach guarantees that safety properties are preserved, while additional reasoning is required to prove liveness properties. Our previous work proposes to use real-time trigger-response properties to reason about liveness properties and timed properties in real-time systems. Conditions such as weak fairness assumptions, relative deadlock freedom, and conditional convergence are explored to eliminate Zeno behavior when modeling real-time systems. In this reasoning framework, the response events are required not to be disabled by other events. This paper extends our previous results by using strong fairness assumptions to relax the constraints on response events. Refinement rules and strategies are also developed to refine real-time systems in the form of trace semantics and LTL operators with fairness assumptions. A simplified bounded re-transmission protocol case study is used to illustrate the approach.
Text
author-submitted
- Author's Original
More information
Submitted date: 21 March 2021
Accepted/In Press date: 8 May 2021
Venue - Dates:
The 15th International Symposium on Theoretical Aspects of Software Engineering, , Shanghai, China, 2021-08-25 - 2021-08-27
Identifiers
Local EPrints ID: 449398
URI: http://eprints.soton.ac.uk/id/eprint/449398
PURE UUID: f155a889-17eb-49c5-83a7-95a605f3b131
Catalogue record
Date deposited: 27 May 2021 16:30
Last modified: 17 Mar 2024 03:39
Export record
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
