Event Structure Semantics of Parallel Extrusion in the Pi-Calculus

Crafa, Silvia; Varacca, Daniele; Yoshida, Nobuko

doi:10.1007/978-3-642-28729-9_15

Cited by 31 publications

(39 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is in contrast with the causal semantics of the π-calculus proposed in Ref. [12]. A full comparison of the present work with the event structure semantics is our current interest.…”

Section: Other Notable Featurescontrasting

confidence: 61%

See 1 more Smart Citation

A Compositional Semantics for the Reversible p-Calculus

Cristescu¹,

Krivine²,

Varacca³

2013

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Self Cite

125

View full text Add to dashboard Cite

We introduce a labelled transition semantics for the reversible π-calculus. It is the first account of a compositional definition of a reversible calculus, that has both concurrency primitives and name mobility.The notion of reversibility is strictly linked to the notion of causality. We discuss the notion of causality induced by our calculus, and we compare it with the existing notions in the literature, in particular for what concerns the syntactic feature of scope extrusion, typical of the π-calculus.

show abstract

“…This is in contrast with the causal semantics of the π-calculus proposed in Ref. [12]. A full comparison of the present work with the event structure semantics is our current interest.…”

Section: Other Notable Featurescontrasting

confidence: 61%

“…As mentioned, this is not the case for the event structure semantics presented in [12]. We plan to find a way to lift the semantics presented here to event structures.…”

Section: Discussionmentioning

confidence: 82%

A Compositional Semantics for the Reversible p-Calculus

Cristescu¹,

Krivine²,

Varacca³

2013

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Self Cite

125

View full text Add to dashboard Cite

show abstract

“…There has been quite some work on providing non-interleaving semantics for pi-calculus [17,13,5,3,21,7,9,11,10] and process algebras in general (e.g. [4,6]).…”

Section: Introductionmentioning

confidence: 99%

“…Stability means that every event depends on a unique history of past events, which supports reversibility of computations. A denotational semantics for the pi-calculus is provided in [9] as extended event structures. The semantics discards the property of stability to avoid the complexity and increase in number of events arising from achieving unique dependency histories.…”

Section: Introductionmentioning

confidence: 99%

A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus

Hildebrandt

Johansen

Normann

2017

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Abstract. We give the first non-interleaving early operational semantics for the pi-calculus which generalizes the standard interleaving semantics and unfolds to the stable model of prime event structures. Our starting point is the non-interleaving semantics given for CCS by Mukund and Nielsen, where the so-called structural (prefixing or subject) causality and events are defined from a notion of locations derived from the syntactic structure of the process terms. The semantics is conservatively extended with a notion of extruder histories, from which we infer the so-called link (name or object) causality and events introduced by the dynamic communication topology of the pi-calculus. We prove that the semantics generalises both the standard interleaving early semantics for the pi-calculus and the the non-interleaving semantics for CCS. In particular, it gives rise to a labelled asynchronous transition system unfolding to prime event structures.

show abstract

“…Hence we group these semantics together as a single approach to causality. Secondly, in [9], action a(z) in the example above depends on one of the extruders, but there is no need to keep track of which one exactly. This causal semantics is defined for the forward-only π-calculus.Finally, the first compositional causal semantics for the reversible π-calculus is introduced in [10].…”

mentioning

confidence: 99%

A Parametric Framework for Reversible Pi-Calculi

Medić¹,

Mezzina²,

Phillips³

et al. 2018

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

This paper presents a study of causality in a reversible, concurrent setting. There exist various notions of causality in π-calculus, which differ in the treatment of parallel extrusions of the same name. In this paper we present a uniform framework for reversible π-calculi that is parametric with respect to a data structure that stores information about an extrusion of a name. Different data structures yield different approaches to the parallel extrusion problem. We map three well-known causal semantics into our framework. We show that the (parametric) reversibility induced by our framework is causallyconsistent and prove a causal correspondence between an appropriate instance of the framework and Boreale and Sangiorgi's causal semantics. * This work was partially supported by COST Action IC1405 "Reversible computation -extending horizons of computing", the input action on a depends on the output on b. In the case of parallel extrusions of the same name, for example νa (ba | ca | a(z)), there exist different interpretations of which extrusion will cause the action a(z). In what follows, we consider three approaches.The classical and the most used approach to causality in the π-calculus is the one where the order of extrusions matters and the first one of them is the cause of the action a(z). Some of the causal semantics representing this idea are [15,6,8] and all of them are defined for standard (forward-only) π-calculus. In [15] the authors claim that, after abstracting away from the technique used to record causal dependences, the final order between the actions in their semantics coincides with the ones introduced in [6, 8]. Hence we group these semantics together as a single approach to causality. Secondly, in [9], action a(z) in the example above depends on one of the extruders, but there is no need to keep track of which one exactly. This causal semantics is defined for the forward-only π-calculus.Finally, the first compositional causal semantics for the reversible π-calculus is introduced in [10]. In the above example, parallel extrusions are concurrent and the action a(z) will record dependence on one of them (exactly which one is decided by the context). This causal semantics enjoys certain correctness properties which are not satisfied by other semantics.Here we present a framework for reversible π-calculus that is parametric with respect to the data structure that stores information about an extrusion of a name. Different data structures will lead to different approaches to the parallel extrusion problem, including the three described above. Our framework allows us to add reversibility to semantics where it was not previously defined. By varying the parameters, different orderings of the causally-consistent backward steps are allowed. Our intention is to develop a causal behavioural theory for the framework, in order to better understand different interpretations of reversibility in the π-calculus, and to use this understanding for causal analysis of concurrent programs.A preliminary discussion of the...

show abstract

Event Structure Semantics of Parallel Extrusion in the Pi-Calculus

Cited by 31 publications

References 24 publications

A Compositional Semantics for the Reversible p-Calculus

A Compositional Semantics for the Reversible p-Calculus

A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus

A Parametric Framework for Reversible Pi-Calculi

Contact Info

Product

Resources

About