On the validity of encodings of the synchronous in the asynchronous π-calculus

被引:1
|
作者
van Glabbeek, Rob J. [1 ,2 ]
机构
[1] CSIRO, Data61, Sydney, NSW, Australia
[2] Univ New South Wales, Sch Comp Sci & Engn, Sydney, NSW, Australia
关键词
Concurrency; Process calculi; Expressiveness; Quality criteria for encodings; pi-calculus; IN-PROCESS CALCULI; MOBILE PROCESSES; LEADER ELECTION; EXPRESSIVENESS; COMMUNICATION; PERSISTENCE; SEPARATION; LINEARITY; SYSTEMS; CHOICE;
D O I
10.1016/j.ipl.2018.04.015
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Process calculi may be compared in their expressive power by means of encodings between them. A widely accepted definition of what constitutes a valid encoding for (dis)proving relative expressiveness results between process calculi was proposed by Gorla. Prior to this work, diverse encodability and separation results were generally obtained using distinct, and often incompatible, quality criteria on encodings. Textbook examples of valid encoding are the encodings proposed by Boudol and by Honda & Tokoro of the synchronous choice-free pi-calculus into its asynchronous fragment, illustrating that the latter is no less expressive than the former. Here I formally establish that these encodings indeed satisfy Gorla's criteria. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:17 / 25
页数:9
相关论文
共 50 条
  • [1] π-calculus models of synchronous and asynchronous message passing (Extended abstract)
    Potter, JM
    Zic, JJ
    Liu, AYW
    FORMAL METHODS PACIFIC '97, 1997, : 309 - 310
  • [2] On the asynchronous nature of the asynchronous π-calculus
    Beauxis, Romain
    Palamidessi, Catuscia
    Valencia, Frank D.
    CONCURRENCY, GRAPHS AND MODELS: ESSAYS DEDICATED TO UGO MONTANARI ON THE OCCASION OF HIS 65TH BIRTHDAY, 2008, 5065 : 473 - +
  • [3] A synchronous π-calculus
    Amadio, Roberto M.
    INFORMATION AND COMPUTATION, 2007, 205 (09) : 1470 - 1490
  • [4] Asynchronous box calculus
    Devillers, R
    Klaudel, H
    Koutny, M
    Pommereau, F
    FUNDAMENTA INFORMATICAE, 2003, 54 (04) : 295 - 344
  • [5] On bisimulations for the asynchronous π-calculus
    Amadio, RM
    Castellani, I
    Sangiorgi, D
    THEORETICAL COMPUTER SCIENCE, 1998, 195 (02) : 291 - 324
  • [6] Probabilistic asynchronous π-calculus
    Herescu, OM
    Palamidessi, C
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, 2000, 1784 : 146 - 160
  • [7] AN OBJECT CALCULUS FOR ASYNCHRONOUS COMMUNICATION
    HONDA, K
    TOKORO, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 512 : 133 - 147
  • [8] A game semantics of the asynchronous π-calculus
    Laird, J
    CONCUR 2005 - CONCURRENCY THEORY, PROCEEDINGS, 2005, 3653 : 51 - 65
  • [9] Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines
    Biernacka, Malgorzata
    Biernacki, Dariusz
    Lenglet, Serguei
    Polesiuk, Piotr
    Pous, Damien
    Schmitt, Alan
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [10] Synchronous and Asynchronous Tools
    Hodges, Charles B.
    Hunger, Gail M.
    TECHTRENDS, 2011, 55 (05) : 39 - 44