[1] J. A. Bergstra and J. W. Klop. Fixed point semantics in process algebra. CWI Report IW 206/82, Centre for Mathematics and Computer Science, August 1982. Electronic version
[2] C. P. J. Koymans and J. L. M. Vrancken. Extending process algebra with the empty process ϵ. Logic Group Preprint Series 1, Department of Philosophy, Utrecht University, Utrecht, 1985.
[3] J. C. M. Baeten and F. W. Vaandrager. Specification and verification of a circuit in ACP (revised version). Report P8821, Programming Research Group, University of Amsterdam, Amsterdam, October 1988. Electronic version
[4] A. van Waveren. Specification of remote sensing mechanisms in real space process algebra. Report P9220, Programming Research Group, University of Amsterdam, Amsterdam, 1992.
[5] A. Stins and A. Schoneveld. Specification of a bank account with process algebra. Report P9307, Programming Research Group, University of Amsterdam, Amsterdam, 1993.
[6] J. C. M. Baeten and J. A. Bergstra. Some simple calculations in relative time process algebra. In E. H. L. Aarts, H. M. M. ten Eikelder, C. Hemerik, and M. Rem, editors, Simplex Sigillum Veri, pages 67–74. Eindhoven University of Technology, Eindhoven, 1995. Liber Amicorum dedicated to prof. dr. F. E. J. Kruseman Aretz. Electronic version
[7] J. C. M. Baeten and M. A. Reniers. Discrete time process algebra with relative timing. Unpublished lecture notes of Eindhoven University of Technology Course 21.920 ”Process Algebra”, 1995.
[8] J. A. Bergstra and P. Klint. The discrete time ToolBus. Report P9502, Programming Research Group, University of Amsterdam, 1995. Electronic version
[9] J. J. Vereijken. A process algebra for hybrid systems. Extended abstract of talk presented at Second European Workshop on Real-Time and Hybrid Systems, Grenoble, 1995.
[10] M. A. Reniers and J. J. Vereijken. Completeness in discrete-time process algebra. Computer Science Report 96-15, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, 1996. Electronic version
[11] J. C. M. Baeten and J. J. Vereijken. Discrete-time process algebra with empty process. In M. Bruné, A. van Deursen, and J. Heering, editors, Dat is dus heel interessant, pages 5–24. CWI, Amsterdam, 1997. Liber Amicorum dedicated to prof. dr. P. Klint. Electronic version
[12] J. F. Groote. The syntax and semantics of timed μCRL. CWI Report SEN-R9709, Centre for Mathematics and Computer Science, Amsterdam, June 1997. Electronic version
[13] J. F. Groote and J. J. van Wamel. Basic theorems for parallel processes in timed μCRL. CWI Report SEN-R9808, Centre for Mathematics and Computer Science, Amsterdam, June 1998. Electronic version
[14] T. A. C. Willemse. The analysis of a conveyor belt system, a case study in hybrid systems and timed μCRL. Computer Science Report 99-10, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, August 1999. Electronic version
[15] Yuan Zhaorui. Specification and validation of telecommunication services in ACPτ. Logic Group Preprint Series 196, Department of Philosophy, Utrecht University, Utrecht, December 1999. Electronic version
[16] J. C. M. Baeten. Process algebra with explicit termination. Computer Science Report 00-02, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, March 2000. Electronic version
[17] J. C. M. Baeten and J. A. Bergstra. Mode transfer in process algebra. Computer Science Report 00-01, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, January 2000. Electronic version
[18] J. C. M. Baeten and M. A. Reniers. Termination in timed process algebra. Computer Science Report 00-13, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, June 2000. Electronic version
[19] W. J. Fokkink and S. P. Luttik. An omega-complete equational specification of interleaving. CWI Report SEN-R0012, Centre for Mathematics and Computer Science, Amsterdam, May 2000. Electronic version
[20] J. C. M. Baeten and J. A. Bergstra. Process algebra with pointers. Computer Science Report 02-03, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, March 2002. Electronic version
[21] J. C. M. Baeten, C. A. Middelburg, and M. A. Reniers. A new equivalence for processes with timing — with an application to protocol verification. Computer Science Report 02-10, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, October 2002. Electronic version
[22] J. A. Bergstra and C. A. Middelburg. Process algebra with conditionals in the presence of epsilon. Computer Science Report 05-15, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, May 2005. Electronic version
[23] C. A. Middelburg. Process algebra, process scheduling, and mutual exclusion. Technical report, CoRR, March 2020. arXiv:2003.00473
[24] R. J. van Glabbeek and C. A. Middelburg. On infinite guarded recursive specifications in process algebra. Technical report, CoRR, May 2020. arXiv:2005.00746
[25] C. A. Middelburg. Dormancy-aware timed branching bisimilarity, with an Application to Communication Protocol Analysis. Technical report, CoRR, July 2021. arXiv:2107.08921