Explicit fairness in testing semantics

In 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.

[1]  Matthew Hennessy,et al.  An Algebraic Theory of Fair Asynchronous Communicating Processes , 1985, ICALP.

[2]  Manuel Núñez,et al.  Fair Testing through Probabilistic Testing , 1999, FORTE.

[3]  Walter Vogler,et al.  Modular Construction and Partial Order Semantics of Petri Nets , 1992, Lecture Notes in Computer Science.

[4]  C. J. Koomen.  Algebraic specification and verification of communication protocols , 1985 .

[5]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

[6]  Arend Rensink,et al.  Applications of Fair Testing , 1996, FORTE.

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[9]  ROBIN MILNER,et al.  Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .

[10]  Gerardo Costa,et al.  Weak and Strong Fairness in CCS , 1987, Inf. Comput..

[11]  Uwe Nestmann.  What is a "Good" Encoding of Guarded Choice? , 2000, Inf. Comput..

[12]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[13]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and the asynchronous π-calculus , 1998, POPL '97.

[14]  Joseph Sifakis,et al.  Fairness and related properties in transition systems — a temporal logic to deal with fairness , 1983, Acta Informatica.

[15]  Carolyn L. Talcott,et al.  A foundation for actor computation , 1997, Journal of Functional Programming.

[16]  Matthew Hennessy,et al.  Acceptance trees , 1985, JACM.

[17]  Cédric Fournet,et al.  The Join Calculus: A Language for Distributed Mobile Programming , 2000, APPSEM.

[18]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[19]  Amir Pnueli,et al.  On the extremely fair treatment of probabilistic algorithms , 1983, STOC.

[20]  Gerardo Costa,et al.  A fair calculus of communicating systems , 1983, Acta Informatica.

[21]  Walter Vogler,et al.  Fairness of Actions in System Computations , 2006, Acta Informatica.

[22]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[23]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and asynchronous $pi$-calculi , 2003, Mathematical Structures in Computer Science.

[24]  Rocco De Nicola,et al.  Testing Equivalence for Mobile Processes , 1995, Inf. Comput..

[25]  Rance Cleaveland,et al.  Divergence and Fair Testing , 1995, ICALP.

[26]  Benjamin C. Pierce,et al.  Pict: a programming language based on the Pi-Calculus , 2000, Proof, Language, and Interaction.

[27]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 1996, Inf. Comput..

[28]  Cédric Fournet,et al.  A hierarchy of equivalences for asynchronous calculi , 1998, J. Log. Algebraic Methods Program..

[29]  Nobuko Yoshida,et al.  Replication in Concurrent Combinators , 1994, TACS.

[30]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[31]  Willem P. de Roever,et al.  Fairness Assumptions for CSP in a Temporal Logic Framework , 1982, Formal Description of Programming Concepts.

[32]  Ed Brinksma.  Invited Address I , 1995 .

[33]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[34]  Robin Milner,et al.  Verifying a Protocol Using Relativized Bisimulation , 1987, ICALP.

[35]  D. Walker,et al.  A Calculus of Mobile Processes, Part I , 1989 .

[36]  Walter Vogler,et al.  Fairness of Components in System Computations , 2005, EXPRESS.

[37]  Ed Brinksma,et al.  Cache consistency by design , 1999, Distributed Computing.

[38]  Catuscia Palamidessi,et al.  Separation of synchronous and asynchronous communication via testing , 2006, Theor. Comput. Sci..