Formal Treatment of Real-time Properties in Event-B
Formal Treatment of Real-time Properties in Event-B
Timing and concurrency are two critical properties of Cyber-Physical Systems (CPS). Functional and timing requirements needed to be satisfied in CPS to avoid unsafe situations. Formal methods, which are mathematical techniques for specifying and verifying systems, aid software engineering by ensuring the correctness of the system design.
The Event-B formalism offers a stepwise development approach to manage complexity in system design. Our work provides formal treatment of real-time properties in Event-B models from both the semantics perspective and syntax perspective. There is existing work on treating real-time 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. 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.
Also, the existing work that extends Event-B models with discrete timing properties inadequately represents the communication and competition between concurrent tasks in concurrent systems. We present the semantics of parameterized real-time trigger-response properties of Event-B models based on timing invariants. We show a method of syntactically encoding parameterized real-time trigger-response properties in Event-B machines. To capture the concurrency between tasks, we distinguish end-to-end timing properties and scheduler-based timing properties from the perspective of different system design phases. We model end-to-end timing properties as parameterized timing properties and scheduler-based timing properties as unparameterized timing properties. A nondeterministic queue-based scheduling framework is proposed to replace end-to-end timing properties with scheduler-based timing properties.
Finally, we demonstrate our approach with three real-time case studies. We show how to treat real-time properties in a stepwise modeling and verification process with Event-B models.
University of Southampton
Zhu, Chenyang
67a1c085-5e0b-4dcf-8770-b99c520115fc
July 2020
Zhu, Chenyang
67a1c085-5e0b-4dcf-8770-b99c520115fc
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Zhu, Chenyang
(2020)
Formal Treatment of Real-time Properties in Event-B.
University of Southampton, Doctoral Thesis, 150pp.
Record type:
Thesis
(Doctoral)
Abstract
Timing and concurrency are two critical properties of Cyber-Physical Systems (CPS). Functional and timing requirements needed to be satisfied in CPS to avoid unsafe situations. Formal methods, which are mathematical techniques for specifying and verifying systems, aid software engineering by ensuring the correctness of the system design.
The Event-B formalism offers a stepwise development approach to manage complexity in system design. Our work provides formal treatment of real-time properties in Event-B models from both the semantics perspective and syntax perspective. There is existing work on treating real-time 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. 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.
Also, the existing work that extends Event-B models with discrete timing properties inadequately represents the communication and competition between concurrent tasks in concurrent systems. We present the semantics of parameterized real-time trigger-response properties of Event-B models based on timing invariants. We show a method of syntactically encoding parameterized real-time trigger-response properties in Event-B machines. To capture the concurrency between tasks, we distinguish end-to-end timing properties and scheduler-based timing properties from the perspective of different system design phases. We model end-to-end timing properties as parameterized timing properties and scheduler-based timing properties as unparameterized timing properties. A nondeterministic queue-based scheduling framework is proposed to replace end-to-end timing properties with scheduler-based timing properties.
Finally, we demonstrate our approach with three real-time case studies. We show how to treat real-time properties in a stepwise modeling and verification process with Event-B models.
Text
Thesis
- Version of Record
Text
PDThesis form Zhu - SIGNED
Restricted to Repository staff only
More information
Published date: July 2020
Identifiers
Local EPrints ID: 448146
URI: http://eprints.soton.ac.uk/id/eprint/448146
PURE UUID: f10d0302-b1a9-413a-a0d7-8c0fd9c5508c
Catalogue record
Date deposited: 13 Apr 2021 16:30
Last modified: 17 Mar 2024 02:58
Export record
Contributors
Author:
Chenyang Zhu
Thesis advisor:
Michael Butler
Thesis advisor:
Corina Cirstea
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