Add to ORKGInternational audienceIn this paper we investigate fair computations in the $\pi$-calculus \cite{MPW92}. Following Costa and Stirling's approach for CCS-like languages \cite{CS84,CS87}, we consider a method to label process actions in order to filter out unfair computations. We contrast the existing fair-testing notion \cite{RV07,NC95} with those that naturally arise by imposing weak and strong fairness. This comparison provides insight about the expressiveness of the various `fair' testing semantics and about their discriminating power
20 pages.International audienceIn previous work with Pous, we defined a semantics for CCS which may ...
AbstractThe Pict programming language is an implementation of the π-calculus in which executions of ...
AbstractThis paper describes a general framework for modeling fairness for communicating processes, ...
International audienceIn this paper we investigate fair computations in the $\pi$-calculus \cite{MPW...
International audienceIn this paper, we define fair computations in the pi-calculus. We follow Costa...
Abstract. In this paper we investigate fair computations in the pi-calculus [25]. Following Costa an...
AbstractIn this paper, we define fair computations in the π-calculus [Milner, R., Parrow, J. & Walke...
In this paper, we define fair computations in the π-calculus [18]. We follow Costa and Stirling’s ap...
80 pages.International audienceIn previous work with Pous, we defined a semantics for CCS which may ...
AbstractIn this paper we provide a simple characterization of (weak) fairness of components as defin...
AbstractIn this paper we provide a simple characterization of (weak) fairness of components as defin...
AbstractVarious principles of proof have been proposed to reason about fairness. This paper addresse...
AbstractWe examine the issue of weak and strong fairness in the framework of Milner's CCS. Our appro...
AbstractFairness of a program execution, c, is usually expressed such that all objects which are suf...
AbstractWe construct several denotational semantics for communicating processes that incorporate ass...
20 pages.International audienceIn previous work with Pous, we defined a semantics for CCS which may ...
AbstractThe Pict programming language is an implementation of the π-calculus in which executions of ...
AbstractThis paper describes a general framework for modeling fairness for communicating processes, ...
International audienceIn this paper we investigate fair computations in the $\pi$-calculus \cite{MPW...
International audienceIn this paper, we define fair computations in the pi-calculus. We follow Costa...
Abstract. In this paper we investigate fair computations in the pi-calculus [25]. Following Costa an...
AbstractIn this paper, we define fair computations in the π-calculus [Milner, R., Parrow, J. & Walke...
In this paper, we define fair computations in the π-calculus [18]. We follow Costa and Stirling’s ap...
80 pages.International audienceIn previous work with Pous, we defined a semantics for CCS which may ...
AbstractIn this paper we provide a simple characterization of (weak) fairness of components as defin...
AbstractIn this paper we provide a simple characterization of (weak) fairness of components as defin...
AbstractVarious principles of proof have been proposed to reason about fairness. This paper addresse...
AbstractWe examine the issue of weak and strong fairness in the framework of Milner's CCS. Our appro...
AbstractFairness of a program execution, c, is usually expressed such that all objects which are suf...
AbstractWe construct several denotational semantics for communicating processes that incorporate ass...
20 pages.International audienceIn previous work with Pous, we defined a semantics for CCS which may ...
AbstractThe Pict programming language is an implementation of the π-calculus in which executions of ...
AbstractThis paper describes a general framework for modeling fairness for communicating processes, ...