The fusion calculus: expressiveness and symmetry in mobile processes

Parrow, Joachim; Victor, Björn

doi:10.1109/lics.1998.705654

Cited by 107 publications

(111 citation statements)

References 12 publications

Supporting

Mentioning

109

Contrasting

Order By: Relevance

“…We stick to the simpler correspondence just for notational convenience. Note that the encoding presented in [11] does satisfy our criterion. We shall assume here the standard pi-calculus late operational semantics [7] and, for the purpose of our comparison, we shall identify the late input pi-action a( x) with the Fusion input action ( x) a x.…”

Section: Fusion and Pimentioning

confidence: 99%

“…Below, we fix an arbitrary Π-equivalence included in trace equivalence, ∼ Π , and an arbitrary F -equivalence which is included in trace equivalence and is preserved by parallel composition, ∼ F (like, e.g., hyperequivalence of [11]). …”

Section: Fusion and Pimentioning

confidence: 99%

“…Languages like Highwire [4] provide, in a concurrency setting, sophisticated data structures; these allow programmers to describe and manipulate complex messages and interaction patterns. If one looks for 'foundational' counterparts of these programming languages, both the pi-calculus [6,7] and the Fusion calculus [11], seem very promising candidates. Both of them, indeed, convey the idea of message-passing in a distilled form, and come equipped with a rich and elegant meta-theory.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

D-Fusion: A Distinctive Fusion Calculus

Boreale

Buscemi

Montanari

2004

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Fusion calculus is commonly regarded as a generalisation of picalculus. Actually, we prove that there is no uniform fully abstract embedding of pi-calculus into Fusion. This fact motivates the introduction of a new calculus, D-Fusion, with two binders, λ and ν. We show that D-Fusion is strictly more expressive than both pi-calculus and Fusion. The expressiveness gap is further clarified by the existence of a fully abstract encoding of mixed guarded choice into the choice-free fragment of D-Fusion.

show abstract

Section: Fusion and Pimentioning

confidence: 99%

Section: Fusion and Pimentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

D-Fusion: A Distinctive Fusion Calculus

Boreale

Buscemi

Montanari

2004

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…While Fusion is presented in [10] as a generalisation of the pi-calculus, the authors prove in the paper [1] that no satisfactory semantic embedding exists of pi-calculus into Fusion. In particular, Fusion ignores the issue of name unicity.…”

Section: Introductionmentioning

confidence: 99%

“…This is certainly the case for foundational calculi like pi-calculus [5,6] and Fusion [10], but the relevance of name binding extends also to languages like Biztalk [4] and Highwire [3], oriented towards web services. Fusion extends the pi-calculus by introducing fusions, i.e.…”

Section: Introductionmentioning

confidence: 99%

A General Name Binding Mechanism

Boreale

Buscemi

Montanari

2005

Trustworthy Global Computing

View full text Add to dashboard Cite

Abstract. We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of binding. The latter can be used both to control the scope of fusions and to handle new name generation. This is achieved by means of a simple form of typing: each bound name x is annotated with a set of exceptions, that is names that cannot be fused to x. The new calculus is proven to be more expressive than pi-calculus and Fusion calculus separately. In U-Calculus, the syntactic nesting of name binders has a semantic meaning, which cannot be overcome by the ordering of name extrusions at runtime. Thanks to this mixture of static and dynamic ordering of names, U-Calculus admits a form of labelled bisimulation which is a congruence. This property yields a substantial improvement with respect to previous proposals by the same authors aimed at unifying the above two languages. The additional expressiveness of U-Calculus is also explored by providing a uniform encoding of mixed guarded choice into the choice-free sub-calculus.

show abstract

Bisimilarity of Open Terms

Rensink

2000

Information and Computation

View full text Add to dashboard Cite

Traditionally, in process calculi, relations over open terms, i.e., terms with free process variables, are defined as extensions of closed-term relations: two open terms are related if and only if all their closed instantiations are related. Working in the context of bisimulation, in this paper we study a different approach; we define semantic models for open terms, so-called conditional transition systems, and define bisimulation directly on those models. It turns out that this can be done in at least two different ways, one giving rise to De Simone's formal hypothesis bisimilarity and the other to a variation which we call hypothesis-preserving bisimilarity (denoted t fh and t hp , respectively). For open terms, we have (strict) inclusions t fh / t hp / t ci (the latter denoting the standard``closed instance'' extension); for closed terms, the three coincide. Each of these relations is a congruence in the usual sense. We also give an alternative characterisation of t hp in terms of nonconditional transitions, as substitution-closed bisimilarity (denoted t sb ). Finally, we study the issue of recursion congruence: we prove that each of the above relations is a congruence with respect to the recursion operator; however, for t ci this result holds under more restrictive conditions than for t fh and t hp .

show abstract

The fusion calculus: expressiveness and symmetry in mobile processes

Cited by 107 publications

References 12 publications

D-Fusion: A Distinctive Fusion Calculus

D-Fusion: A Distinctive Fusion Calculus

A General Name Binding Mechanism

Bisimilarity of Open Terms

Contact Info

Product

Resources

About