A fairness-based refinement strategy to transform liveness properties in Event-B models

Science of Computer Programming(2023)

引用 4|浏览24
暂无评分
摘要
Stepwise 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 with Event-B proof obligations, while additional reasoning and fairness assumptions are required to prove the transformation of liveness properties in Event-B models. This paper presents a new proof-based approach that integrates Linear Temporal Logic (LTL) and Event-B for reasoning about the refinement of liveness properties. We first developed an extended version of LTL that could be used in Event-B models with three basic atomic propositions: state-related propositions, event-related propositions, and enabledness of events. Then we employed this extended LTL to express four important temporal properties with Event-B proof obligations and fairness assumptions. Besides the typical Event-B proof obligations, we specified conditions such as relative deadlock freeness, conditional convergence, and fairness assumptions to allow temporal properties to be transformed during refinement steps. The generic fairness-based refinement strategies were developed to replace or strengthen the fairness assumptions in the refinement steps of Event-B models. A reliable retransmission example is used to illustrate the approach.
更多
查看译文
关键词
Event-B,Linear temporal logic,Fairness assumptions,Refinement
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要