Typed event structures and the linear π-calculus

被引:15
|
作者
Varacca, Daniele [1 ,2 ]
Yoshida, Nobuko [3 ]
机构
[1] Univ Paris Diderot, PPS, Paris, France
[2] CNRS, F-75700 Paris, France
[3] Univ London Imperial Coll Sci Technol & Med, London SW7 2AZ, England
基金
英国工程与自然科学研究理事会;
关键词
Event structures; Types; Linearity; Confusion freeness; pi-calculus; STRUCTURE SEMANTICS; PETRI NETS;
D O I
10.1016/j.tcs.2010.01.024
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose a typing system for the true concurrent model of event structures that guarantees the interesting behavioural properties known as conflict freeness and confusion freeness. Conflict freeness is the true concurrent version of the notion of confluence. A system is confusion free if nondeterministic choices are localised and do not depend on the scheduling of independent components. Ours is the first typing system to control behaviour in a true concurrent model. To demonstrate its applicability, we show that typed event structures give a semantics of linearly typed version of the pi-calculi with internal mobility. The semantics we provide is the first event structure semantics of the pi-calculus and generalises Winskel's original event structure semantics of CCS. (c) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1949 / 1973
页数:25
相关论文
共 50 条
  • [41] SIMULTANEOUS SUBSTITUTION IN THE TYPED LAMBDA-CALCULUS
    GRAY, JW
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 598 : 207 - 220
  • [42] Recognizability in the Simply Typed Lambda-Calculus
    Salvati, Sylvain
    LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, 2009, 5514 : 48 - 60
  • [43] TELESCOPIC MAPPINGS IN TYPED LAMBDA-CALCULUS
    DEBRUIJN, NG
    INFORMATION AND COMPUTATION, 1991, 91 (02) : 189 - 204
  • [44] Strong normalization of the typed λws-calculus
    David, R
    Guillaume, B
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2003, 2803 : 155 - 168
  • [45] SEMANTICS OF TYPED LAMBDA-CALCULUS WITH CONSTRUCTORS
    Petit, Barbara
    LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (01)
  • [46] Strong normalization of the typed λws-calculus
    David, René
    Guillaume, Bruno
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2803 : 155 - 168
  • [48] XPi: A typed process calculus for XML messaging
    Acciai, Lucia
    Boreale, Michele
    SCIENCE OF COMPUTER PROGRAMMING, 2008, 71 (02) : 110 - 143
  • [49] Constructive data refinement in typed lambda calculus
    Honsell, F
    Longley, J
    Sannella, D
    Tarlecki, A
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, 2000, 1784 : 161 - 176
  • [50] Normalization proofs for the un-typed μμ′-calculus
    Battyanyi, Peter
    Nour, Karim
    AIMS MATHEMATICS, 2020, 5 (04): : 3702 - 3713