Fair testing

[1]  Rocco De Nicola,et al.  Basic Observables for Processes , 1997, ICALP.

[2]  Michael J. Ferguson,et al.  On the Operational Semantics of Nondeterminism and Divergence , 1996, Theor. Comput. Sci..

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

[4]  Bard Bloom,et al.  Structural Operational Semantics for Weak Bisimulations , 1995, Theor. Comput. Sci..

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

[6]  Antti Valmari,et al.  The Weakest Deadlock-Preserving Congruence , 1995, Inf. Process. Lett..

[7]  A. Meyer,et al.  Bisimulation can't be traced , 1995, JACM.

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

[9]  Guy Leduc,et al.  Failure-based congruences, unfair divergences and new testing theory , 1995, PSTV.

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

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

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

[13]  Rance Cleaveland,et al.  Testing Preorders for Probabilistic Processes , 1992, Inf. Comput..

[14]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[15]  Martti Tienari,et al.  An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm , 1991, Protocol Specification, Testing and Verification.

[16]  Rom Langerak.  A Testing Theory for LOTOS using Deadlock Detection , 1989, PSTV.

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

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

[19]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

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

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

[22]  Jan A. Bergstra,et al.  Failures without chaos: a new process semantics for fair abstraction , 1987, Formal Description of Programming Concepts.

[23]  Iain Phillips,et al.  Refusal Testing , 1986, Theor. Comput. Sci..

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

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

[26]  Jan A. Bergstra,et al.  Verification of an alternating bit protocol by means of process algebra , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

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

[28]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[29]  A. W. Roscoe,et al.  An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.

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

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

[32]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

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

[34]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

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