A taxonomy of process calculi for distribution and mobility

Gorla, Daniele

doi:10.1007/s00446-010-0120-6

Cited by 20 publications

(23 citation statements)

References 62 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, the existence of encodings [17]. However, this does hold when the encodings use ≡ rather than in the target language, as is the case for all encodings presented in this work.…”

Section: Fig 2 Relations Between All Languagesmentioning

confidence: 79%

“…The choice of valid encodings here is to align with prior works [16,18,12] and where possible reuse prior results. These valid encodings are those used, sometimes with mild adaptations, in [18,17,25,10,14] and have also inspired similar works [21,22,31]. However, there are alternative approaches to encoding criteria or comparing expressive power [30,3,7,5,27,31].…”

Section: Encodingsmentioning

confidence: 99%

“…However, there are alternative approaches to encoding criteria or comparing expressive power [30,3,7,5,27,31]. Further discussion of the choices of encodings, and contrasting with other approaches can be found in [18,17,29,31,14].…”

Section: Encodingsmentioning

confidence: 99%

See 2 more Smart Citations

On the Expressiveness of Symmetric Communication

Given-Wilson

Legay

2016

Theoretical Aspects of Computing – ICTAC 2016

View full text Add to dashboard Cite

Abstract. The expressiveness of communication primitives has been explored in a common framework based on the π-calculus by considering four features: synchronism, arity, communication medium, and pattern-matching. These all assume asymmetric communication between input and output primitives, however some calculi consider more symmetric approaches to communication such as fusion calculus and Concurrent Pattern Calculus. Symmetry can be considered either as supporting exchange of information between an action and co-action, or as unification of actions. By means of possibility/impossibility of encodings, this paper shows that the exchange approach is related to, or more expressive than, many previously considered languages. Meanwhile, the unification approach is more expressive than some, but mostly unrelated to, other languages.

show abstract

“…Finally, the existence of encodings [17]. However, this does hold when the encodings use ≡ rather than in the target language, as is the case for all encodings presented in this work.…”

Section: Fig 2 Relations Between All Languagesmentioning

confidence: 79%

Section: Encodingsmentioning

confidence: 99%

See 1 more Smart Citation

On the Expressiveness of Symmetric Communication

Given-Wilson

Legay

2016

Theoretical Aspects of Computing – ICTAC 2016

View full text Add to dashboard Cite

show abstract

“…Gorla [23] collected some essential features of the above approaches and integrated them in a proposal for a valid encoding that justifies many encodings and separation results from the literature. Since then, many authors have used Gorla's framework as a basis for establishing new valid encodings and separation results [22,28,44,41,43,16,17,18,19].…”

Section: Introductionmentioning

confidence: 99%

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

Glabbeek

2018

Information Processing Letters

View full text Add to dashboard Cite

“…The work in Gorla (2010) gives a set of requirements for an encoding from MAs to π-calculus. It requires an encoding to be compositional (the encoding of a compound term L. Brodo 206 Table 1.…”

mentioning

confidence: 99%

On the expressiveness of π-calculus for encoding mobile ambients

Brodo

2016

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

We investigate the expressiveness of two classical distributed paradigms by defining the first encoding of the pure mobile ambient calculus into the synchronous π-calculus. Our encoding, whose correctness has been proved by relying on the notion of operational correspondence, shows how the hierarchical ambient structure can be reformulated within a flat channel interconnection amongst independent processes, without centralised control. To easily handle the computation for simulating a capability, we introduce the notions of simulating trace (representing the computation that a π-calculus process has to execute to mimic a capability) and of aborting trace (representing the computation that a π-calculus process executes when the simulation of a capability cannot succeed). Thus, the encoding may introduce loops, but, as it will be shown, the number of steps of any trace, therefore of any aborting trace, is limited, and the number of states of the transition system of the encoding processes still remains finite. In particular, an aborting trace makes a sort of backtracking, leaving the involved sub-processes in the same starting configurations. We also discuss two run-time support methods to make these loops harmless at execution time. Our work defines a relatively simple, direct, and precise translation that reproduces the ambient structure by means of channel links, and keeps track of the dissolving of an ambient.

show abstract

A taxonomy of process calculi for distribution and mobility

Cited by 20 publications

References 62 publications

On the Expressiveness of Symmetric Communication

On the Expressiveness of Symmetric Communication

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

On the expressiveness of π-calculus for encoding mobile ambients

Contact Info

Product

Resources

About