1. A. Aho, J. Hoperoft, and J. Ullman. Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. D. Austry and G. Boudol. Algèbre de processus et synchronisation. Theoretical Computer Sci., 30 (1): 91–131, 1984.
3. J. A. Bergstra and J. W. Klop. Process algebra for synchronous communication. Information and Computation, 60 (1–3): 109–137, 1984.
4. B. Bloom. Ready Simulation, Bisimulation, and the Semantics of CCSLike Languages. PhD thesis, Massachusetts Institute of Technology, Aug. 1989.
5. B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can’t be traced (preliminary report). In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages,pages 229–239, 1988. Also appears as MIT Technical Memo MIT/LCS/TM-345.