Denotational semantics of channel mobility in UTP-CSP

Author:

Ekembe Ngondi Gerard1ORCID

Affiliation:

1. Lero, the SFI Research Centre for Software, Trinity College Dublin, Dublin, Ireland

Abstract

Abstract In this paper, we present the denotational semantics for channel mobility in the Unifying Theories of Programming (UTP) semantics framework. The basis for the model is the UTP theory of reactive processes, precisely, the UTP semantics for Communicating Sequential Processes (CSP), which is extended to allow the mobility of channels—the set of channels that a process can use for communication (its interface), originally static or constant (set during the process's definition), is now made dynamic or variable: it can change during the process's execution. A channel is thus moved around by communicating it via other channels and then allowing the receiving process to extend its interface with the received channel. We introduce a new concept, the capability of a process, which allows separating the ownership of channels from the knowledge of their existence. Mobile processes are then defined as having a static capability and a dynamic interface. Operations of a mobile telecommunications network, e.g., handover, load balancing, are used to illustrate the semantics. We redefine CSP operators and in particular provide the first semantics for the renaming and hiding operators in the context of channel mobility.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Reference29 articles.

1. Abrial JR (1984) The mathematical construction of a program. In: Science of computer programming vol 4. Elsevier pp 45–86. doi: https://doi.org/10.1016/0167-6423(84)90011-X

2. Bialkiewicz J-A Peschanski F (2009) A denotational study of Mobility. In: Communicating process architectures vol 67. IOS Press pp 239–261. https://doi.org/10.3233/978-1-60750-065-0-239

3. Boreale M (1998) On the expressiveness of internal mobility in name-passing calculi. In: Theoretical computer science vol 195. Elsevier pp 205–226. https://doi.org/10.1016/S0304-3975(97)00220-X

4. Broy M Dederichs F Dendorfer C Fuchs M Gritzner TF Weber R (1993) The design of distributed systems—an introduction to FOCUS (revised) Technical Report University of Munich. citeseer.edu/broy93.pdf

5. Cavalcanti A Woodcock J (2006) A tutorial introduction to CSP in unifying theories of programming. In: Refinement techniques in software engineering Springer. pp 220–268. https://doi.org/10.1007/11889229_6

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

1. Semantics of dynamic hiding in mobile UTP-CSP;Theoretical Computer Science;2023-09

2. A Coq Implementation of the Program Algebra in Jifeng He’s New Roadmap for Linking Theories of Programming;Theories of Programming and Formal Methods;2023

3. From CCS to CSP: the m-among-n Synchronisation Approach;Electronic Proceedings in Theoretical Computer Science;2022-09-06

4. Translation of CCS into CSP, Correct up to Strong Bisimulation;Software Engineering and Formal Methods;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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