1. Baeten, J., Bergstra, J., and Klop, J. (1987). On the consistency of Koomen’s fair abstraction rule. Theoretical Computer Science, 51 (1–2): 129–176.
2. Bergstra et al., 1987] Bergstra, J., J.W.Klop, and Olderog, E. (1987). Failures without chaos: A new process semantics for fair abstraction. In Formal Description of Programming Concepts III, pages 77–103. Elsevier.
3. Brinksma, 1988] Brinksma, E. (1988). A theory for the derivation of tests. In Pro- tocol Specification, Testing and Verification VIII, pages 63–74. North Holland.
4. Brinksma et al., 1995] Brinksma, E., Rensink, A., and Vogler, W. (1995). Fair testing. In CONCUR’95, LNCS 962, pages 313–327. Springer.
5. Brinksma et al., 1996] Brinksma, E., Rensink, A., and Vogler, W. (1996). Applications of fair testing. In Formal Description Techniques for Distributed Systems and Communication Protocols (IX), and Protocol Specification, Testing, and Verification (X VI), pages 145–160. Chapman & Hall.