Applications of Fair Testing

In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the specification and analysis of distributed systems. This pre-order combines some features of the standard testing pre-orders, viz. the possibility to refine a specification by the resolution of nondeterminism, with a powerful feature of standard observation congruence, viz. the fair abstraction from divergences. Moreover, it is a pre-congruence with respect to all standard process-algebraic combinators, thus allowing for the standard algebraic proof techniques by substitution and rewriting. In this paper we will demonstrate advantages of the fair testing pre-order by the application to a number of examples, including a scheduling problem, a version of the Alternating Bit-protocol, and fair communication channels.

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

[2]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

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

[4]  Antti Valmari.  Failure-based Equivalences Are Faster Than Many Believe , 1995, STRICT.

[5]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[6]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[7]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[8]  Iso. Lotos,et al.  A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour , 1985 .

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

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

[11]  R. V. Glabbeek.  The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

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

[13]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

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

[15]  J. C. M. Baeten,et al.  Process Algebra: Bibliography , 1990 .

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