Relational concurrent refinement part II: Internal operations and outputs

Author:

Boiten Eerke1,Derrick John2,Schellhorn Gerhard3

Affiliation:

1. Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, UK

2. Department of Computer Science, University of Sheffield, S1 4DP, Sheffield, UK

3. Institute of Software Engineering and Programming Languages, Department of Computer Science, University of Augsburg, 86135, Augsburg, Germany

Abstract

Abstract Two styles of description arise naturally in formal specification: state-based and behavioural. In state-based notations, a system is characterised by a collection of variables, and their values determine which actions may occur throughout a system history. Behavioural specifications describe the chronologies of actions—interactions between a system and its environment. The exact nature of such interactions is captured in a variety of semantic models with corresponding notions of refinement; refinement in state based systems is based on the semantics of sequential programs and is modelled relationally. Acknowledging that these viewpoints are complementary, substantial research has gone into combining the paradigms. The purpose of this paper is to do three things. First, we survey recent results linking the relational model of refinement to the process algebraic models. Specifically, we detail how variations in the relational framework lead to relational data refinement being in correspondence with traces–divergences, singleton failures and failures–divergences refinement in a process semantics. Second, we generalise these results by providing a general flexible scheme for incorporating the two main “erroneous” concurrent behaviours: deadlock and divergence, into relational refinement. This is shown to subsume previous characterisations. In doing this we derive relational refinement rules for specifications containing both internal operations and outputs that corresponds to failures–divergences refinement. Third, the theory has been formally specified and verified using the interactive theorem prover KIV.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Reference46 articles.

1. The B-Book

2. Boiten EA de Roever W-P (2003) Getting to the bottom of relational refinement: relations and correctness partial and total. In: Berghammer R Möller B (eds) 7th International seminar on relational methods in computer science (RelMiCS 7). University of Kiel pp 82–88

3. Relation algebraic semantics of deterministic and non-deterministic programs;Berghammer R;Theor Comp Sci,1986

4. A Theory of Communicating Sequential Processes

Cited by 19 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Understanding, Explaining, and Deriving Refinement;From Astrophysics to Unconventional Computation;2019-04-17

2. Relational Concurrent Refinement;Refinement;2018

3. Process Data Types - A Fully General Model of Concurrent Refinement;Refinement;2018

4. Bibliography;From Action Systems to Distributed Systems;2016-04-20

5. Formal model-driven engineering of critical information systems;Science of Computer Programming;2015-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3