International audienceThis 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. Hence, by using a parametric way of bookkeeping the order and the dependencies among extruders it is possible to map different causal semantics into the same framework. Starting from this simple observation, we present a uniform framework for reversible π-calculi that is parametric with respect to a data structure that stores information about the 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 ...
Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal...
Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal...
We propose a notion of distributed backtracking built on top of Milner's Calculus of Communicating S...
This paper presents a study of causality in a reversible, concurrent setting. There exist various no...
This paper presents a study of causality in a reversible, concurrent setting. There exist various no...
This paper presents a study of causality in a reversible, concurrent setting. There exist various no...
The Concurrency Column of EATCS Bulletin, No 129A number of formalisms have been proposed to model v...
Causal-consistent reversibility is the reference notion of reversibility for concurrency. We introdu...
International audienceThe algebraic specification and representation of networks of agents have been...
International audienceThe notion of reversible computation is attracting increasing interest because...
Abstract—We introduce a labelled transition semantics for the reversible pi-calculus. It is the firs...
This article designs a general principle to check the correctness of the definition of concurrency (...
Conference postponed to 2021 due to covid-19International audienceUndoing computations of a concurre...
International audienceCausal-consistent reversibility is the reference notion of reversibility for c...
Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal...
Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal...
We propose a notion of distributed backtracking built on top of Milner's Calculus of Communicating S...
This paper presents a study of causality in a reversible, concurrent setting. There exist various no...
This paper presents a study of causality in a reversible, concurrent setting. There exist various no...
This paper presents a study of causality in a reversible, concurrent setting. There exist various no...
The Concurrency Column of EATCS Bulletin, No 129A number of formalisms have been proposed to model v...
Causal-consistent reversibility is the reference notion of reversibility for concurrency. We introdu...
International audienceThe algebraic specification and representation of networks of agents have been...
International audienceThe notion of reversible computation is attracting increasing interest because...
Abstract—We introduce a labelled transition semantics for the reversible pi-calculus. It is the firs...
This article designs a general principle to check the correctness of the definition of concurrency (...
Conference postponed to 2021 due to covid-19International audienceUndoing computations of a concurre...
International audienceCausal-consistent reversibility is the reference notion of reversibility for c...
Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal...
Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal...
We propose a notion of distributed backtracking built on top of Milner's Calculus of Communicating S...