Preprints

C.A. Middelburg. A simple language for expressing properties of telecommunication services and features. Publication 94-PU-356, PTT Research, 1994. Electronic version.

J.A. Bergstra, W.J.Fokkink and C.A. Middelburg. A logic for signal inserted timed frames. Logic Group Preprint Series 155, Utrecht University, Department of Philosophy, January 1996. Electronic version.

J.C.M. Baeten, C.A. Middelburg and M.A. Reniers. A new equivalence for processes with timing. Computing Science Report 02-10, Eindhoven University of Technology, Department of Mathematics and Computing Science, October 2002. Electronic version.

J.A. Bergstra and C.A. Middelburg. Process algebra with conditionals in the presence of epsilon. arXiv:1204.3249v1 [cs.LO].

J.A. Bergstra and C.A. Middelburg. Instruction sequences and non-uniform complexity theory. arXiv:0809.0352v3 [cs.CC].

J.A. Bergstra and C.A. Middelburg. Instruction sequences for the production of processes. arXiv:0811.0436v2 [cs.PL].

J.A. Bergstra and C.A. Middelburg. Instruction sequence notations with probabilistic instructions. arXiv:0906.3083v2 [cs.PL].

J.A. Bergstra and C.A. Middelburg. On the definition of a theoretical concept of an operating system. arXiv:1006.0813v1 [cs.OS].

C.A. Middelburg. A survey of paraconsistent logics. arXiv:1103.4324v3 [cs.LO].

J.A. Bergstra and C.A. Middelburg. An application specific informal logic for interest
prohibition theory. arXiv:1104.0308v1 [q-fin.GN].

J.A. Bergstra and C.A. Middelburg. Turing impossibility properties for stack machine
programming. arXiv:1201.6028v1 [cs.LO].

J.A. Bergstra, C.A. Middelburg, and Gh. Stefanescu. Network algebra for synchronous dataflow. arXiv:1303.0382v1 [cs.LO].

J.A. Bergstra and C.A. Middelburg. Instruction sequence expressions for the secure
hash algorithm SHA-256. arXiv:1308.0219v7 [cs.PL].

J.A. Bergstra and C.A. Middelburg. Using Hoare logic in a process algebra setting. arXiv:1906.04491v3 [cs.LO].

C.A. Middelburg. Probabilistic process algebra and strategic interleaving. arXiv:1912.10041v6 [cs.LO].

C.A. Middelburg. Process algebra, process scheduling, and mutual exclusion. arXiv:2003.00473v3 [cs.LO].

R.J. van Glabbeek and C.A. Middelburg. On infinite guarded recursive specifications in
process algebra. arXiv:2005.00746v1 [cs.LO].

C.A. Middelburg. Program algebra for random access machine programs. arXiv:2007.09946v1 [cs.PL].

C.A. Middelburg. A classical-logic view of a paraconsistent logic. arXiv:2008.07292v1 [cs.LO].