Parametric synchronizations in mobile nominal calculi

被引:4
|
作者
Bruni, Roberto [1 ]
Lanese, Ivan [2 ]
机构
[1] Univ Pisa, Dept Informat, I-56100 Pisa, Italy
[2] Univ Bologna, Dipartimento Sci Informaz, I-40126 Bologna, Italy
关键词
process calculi; name mobility; synchronization algebra with mobility; operational semantics; bisimulation congruences; pi-calculus; fusion calculus;
D O I
10.1016/j.tcs.2008.04.029
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present and compare P-PRISMA and F-PRISMA, two parametric calculi that can be instantiated with different interaction policies, defined as synchronization algebras with mobility of names (SAMs). In particular, P-PRISMA is based on name transmission (P-SAM), like pi-calculus, and thus exploits directional (input-output) communication only, while F-PRISMA is based on name fusion (F-SAM), like Fusion calculus, and thus exploits a more symmetric form of communication. However, P-PRISMA and F-PRISMA can easily accommodate many other high-level synchronization mechanisms than the basic ones available in pi-calculus and Fusion, hence allowing for the development of a general meta-theory of mobile calculi. We define for both the labeled operational semantics and a form of strong bisimilarity, showing that the latter is compositional for any SAM. We also discuss reduction semantics and weak bisimilarity. We give several examples based on heterogeneous SAMs, we investigate the case studies of pi-calculus and Fusion calculus giving correspondence theorems, and we show how P-PRISMA can be encoded in F-PRISMA. Finally, we show that basic categorical tools can help to relate and to compose SAMs and PRISMA processes in an elegant way. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:102 / 119
页数:18
相关论文
共 50 条
  • [1] Psi-calculi: Mobile processes, nominal data, and logic
    Bengtson, Jesper
    Johansson, Magnus
    Parrow, Joachim
    Victor, Bjorn
    24TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2009, : 39 - 48
  • [2] PSI-CALCULI: A FRAMEWORK FOR MOBILE PROCESSES WITH NOMINAL DATA AND LOGIC
    Bengtson, Jesper
    Johansson, Magnus
    Parrow, Joachim
    Victor, Bjoern
    LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (01)
  • [3] Model checking for nominal calculi
    Ferrari, GL
    Montanari, U
    Tuosto, E
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2005, 3441 : 1 - 24
  • [4] Event structure semantics for nominal calculi
    Bruni, Roberto
    Melgratti, Hernan
    Montanari, Ugo
    CONCUR 2006 - CONCURRENCY THEORY, PROCEEDINGS, 2006, 4137 : 295 - 309
  • [5] Display calculi for nominal tense logics
    Demri, S
    Goré, R
    JOURNAL OF LOGIC AND COMPUTATION, 2002, 12 (06) : 993 - 1016
  • [6] RULE FORMATS FOR NOMINAL PROCESS CALCULI
    Aceto, Luca
    Fabregas, Ignacio
    Garcia-Perez, Alvaro
    Ingolfsdottir, Anna
    Ortega-Mallen, Yolanda
    LOGICAL METHODS IN COMPUTER SCIENCE, 2019, 15 (04)
  • [7] A parametric framework for reversible π-calculi
    Medic, Doriana
    Mezzina, Claudio Antares
    Phillips, Iain
    Yoshida, Nobuko
    INFORMATION AND COMPUTATION, 2020, 275
  • [8] A Parametric Framework for Reversible π-Calculi
    Medic, Doriana
    Mezzina, Claudio Antares
    Phillips, Lain
    Yoshida, Nobuko
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2018, (276): : 87 - 103
  • [9] A Parametric Tool for Applied Process Calculi
    Borgstrom, Johannes
    Gutkovas, Ramunas
    Rodhe, Ioana
    Victor, Bjorn
    2013 13TH INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD 2013), 2013, : 180 - 185
  • [10] Observing reductions in nominal calculi via a graphical encoding of processes
    Gadducci, F
    Montanari, U
    PROCESSES, TERMS AND CYCLES: STEPS ON THE ROAD TO INFINITY: ESSAYS DEDICATED TO JAN WILLEM KLOP ON THE OCCASION OF HIS 60TH BIRTHDAY, 2005, 3838 : 106 - 126