Normal Bisimulations in Calculi with Passivation

Lenglet, Sergueï; Schmitt, Alan; Stefani, Jean-Bernard

doi:10.1007/978-3-642-00596-1_19

Cited by 13 publications

(31 citation statements)

References 9 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed either the trigger itself or its killer can acquire this lock and then execute, thus leaving the other process blocked forever. The token allows us to avoid to use primitives such as passivation (see [37,38]) or mixed choice to kill input processes. Since all the messages on channel a ∈ N are translated into biadic messages, triggers are translated in order to read such messages.…”

Section: Example 2 (Rollback Of a Parallel Process) Let Us Consider mentioning

confidence: 99%

Reversibility in the higher-order π-calculus

Lanese

Mezzina

Stefani

2016

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Reversibility in the higher-order π-calculus AbstractThe notion of reversible computation is attracting increasing interest because of its applications in diverse fields, in particular the study of programming abstractions for reliable systems. In this paper, we continue the study undertaken by Danos and Krivine on reversible CCS by defining a reversible higher-order π-calculus, called rhoπ. We prove that reversibility in our calculus is causally consistent and that the causal information used to support reversibility in rhoπ is consistent with the one used in the causal semantics of the π-calculus developed by Boreale and Sangiorgi. Finally, we show that one can faithfully encode rhoπ into a variant of higher-order π, substantially improving on the result we obtained in the conference version of this paper.

show abstract

Section: Example 2 (Rollback Of a Parallel Process) Let Us Consider mentioning

confidence: 99%

Reversibility in the higher-order π-calculus

Lanese

Mezzina

Stefani

2016

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Passivation offers the capability of capturing the content of a certain location, and then restarting the execution in a different context. The semantics of passivation has been the subject of a number of papers, usually in extensions of the Higher-Order π-calculus [15,[19][20][21]24]. Passivation is also featured in the Homer calculus [10] and the M-calculus [26]; a similar construct appears in the Seal calculus [4] and in Acute [29].…”

Section: Introductionmentioning

confidence: 99%

On the discriminating power of passivation and higher-order interaction

Bernardo

Sangiorgi

Vignudelli

2014

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Nin

View full text Add to dashboard Cite

This paper studies the discriminating power offered by higherorder concurrent languages, and contrasts this power with those offered by higher-order sequential languages (à la λ-calculus) and by first-order concurrent languages (à la CCS). The concurrent higherorder languages that we focus on are Higher-Order π-calculus (HOπ), which supports higher-order communication, and an extension of HOπ with passivation, a simple higher-order construct that allows one to obtain location-dependent process behaviours.The comparison is carried out by providing embeddings of firstorder processes into the various languages, and then examining the resulting contextual equivalences induced on such processes. As first-order processes we consider both ordinary Labeled Transition Systems (LTSs) and Reactive Probabilistic Labeled Transition Systems (RPLTSs).The hierarchy of discriminating powers so obtained for RPLTSs is finer than that for LTSs. For instance, in the LTS case, the additional discriminating power offered by passivation in concurrency is captured, in sequential languages, by the difference between the call-by-name and call-by-value evaluation strategies of an extended typed λ-calculus.

show abstract

“…Passivation [18], [6], [8], [11] is a language abstraction for elegantly modelling higher-order distributed systems in process calculi based on the higher-order π-calculus [12], [15] (with which we assume our reader's familiarity). In its simplest form, passivation consists of a syntax of located processes l[P ], where l is a name called a location and P is a process located at l, and two labelled transition rules, l [P ] α − → l [P ] if P α − → P (TRANSP), and l [P ] l P − −− → 0 (PASSIV), where the relation P α − →Q in general reads "P does action α and becomes Q."…”

Section: Introductionmentioning

confidence: 99%

“…For example, one can conveniently model failure of a process P at location l as l Name creation versus restriction: To our knowledge, previous process calculi with passivation-or, more generally, with higher-order distribution (i.e. communication of processes through channels across locations)-all used so-called name restriction [6], [18], [8], [11]. It hides names, forbidding reactions like a.Q | νa.…”

Section: Introductionmentioning

confidence: 99%

“…(In contrast, environmental bisimulations for higher-order π-calculus with passivation [11] were far from complete under name restriction semantics, being unsound without severe constraints on environments.) It can then be used to prove non-trivial equivalences that could not be shown previously [11], [8], like that of distributed left and right list folds (simplified versions of "MapReduce" [3]), detailed in Section V.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Higher-Order Distributed Calculus with Name Creation

Piérard

Sumii

2012

2012 27th Annual IEEE Symposium on Logic in Computer Science

View full text Add to dashboard Cite

Abstract-This paper introduces HOπPn, the higher-order π-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Stefani] is a language construct that elegantly models higherorder distributed behaviours like failure, migration, or duplication (e.g. when a running process or virtual machine is copied), and name creation consists in generating a fresh name instead of hiding one. Combined with higher-order distribution, name creation leads to different semantics from name hiding, and is closer to implementations of distributed systems. We define for this new calculus a theory of sound and complete environmental bisimulation to prove reduction-closed barbed equivalence and (a reasonable form of) congruence. We furthermore define environmental simulations to prove behavioural approximation, and use these theories to show non-trivial examples of equivalence or approximation. Those examples could not be proven with previous theories, which were either unsound or incomplete under the presence of process duplication and name restriction, or else required universal quantification over general contexts.

show abstract

Normal Bisimulations in Calculi with Passivation

Cited by 13 publications

References 9 publications

Reversibility in the higher-order π-calculus

Reversibility in the higher-order π-calculus

On the discriminating power of passivation and higher-order interaction

A Higher-Order Distributed Calculus with Name Creation

Contact Info

Product

Resources

About