| 2009 | ICTAC | Transmission Protocols for Instruction Streams. | Jan A. Bergstra, Cornelis A. Middelburg |
| 2006 | CiE | Elementary Algebraic Specifications of the Rational Function Field. | Jan A. Bergstra |
| 2005 | CALCO | Strong Splitting Bisimulation Equivalence. | Jan A. Bergstra, Cornelis A. Middelburg |
| 2005 | CiE | A Thread Algebra with Multi-level Strategic Interleaving. | Jan A. Bergstra, Cornelis A. Middelburg |
| 2003 | ICALP | Polarized Process Algebra and Program Equivalence. | Jan A. Bergstra, Inge Bethke |
| 1997 | CONCUR | Bounded Stacks, Bags and Queues. | Jos C. M. Baeten, Jan A. Bergstra |
| 1996 | Coordination | The TOOLBUS Coordination Architecture. | Jan A. Bergstra, Paul Klint |
| 1996 | ESOP | A Complete Transformational Toolkit for Compilers. | Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering |
| 1995 | FCT | Discrete Time Process Algebra with Abstraction. | Jos C. M. Baeten, Jan A. Bergstra |
| 1995 | FCT | Processes with Multiple Entries and Exits. | Jan A. Bergstra, Gheorghe Stefanescu |
| 1994 | CONCUR | Process Algebra with Partial Choice. | Jos C. M. Baeten, Jan A. Bergstra |
| 1993 | CONCUR | Non Interleaving Process Algebra. | Jos C. M. Baeten, Jan A. Bergstra |
| 1993 | CSL | Process Algebra with Combinators. | Jan A. Bergstra, Inge Bethke, Alban Ponse |
| 1993 | FCT | Translations Between Flowchart Schemes and Process Graphs. | Jan A. Bergstra, Gheorghe Stefanescu |
| 1992 | CONCUR | Discrete Time Process Algebra. | Jos C. M. Baeten, Jan A. Bergstra |
| 1992 | CONCUR | Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). | Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka |
| 1991 | CONCUR | Real Space Process Algebra. | Jos C. M. Baeten, Jan A. Bergstra |
| 1990 | CONCUR | Process Algebra with a Zero Object. | Jos C. M. Baeten, Jan A. Bergstra |
| 1984 | CONCUR | Process Algebra with Asynchronous Communication Mechanisms. | Jan A. Bergstra, Jan Willem Klop, John V. Tucker |
| 1984 | ICALP | The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. | Jan A. Bergstra, Jan Willem Klop |
| 1983 | ICALP | Linear Time and Branching Time Semantics for Recursion with Merge. | J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer |
| 1982 | ICALP | Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. | Jan A. Bergstra, Jan Willem Klop |
| 1981 | GI | A Characterization of Program Equivalence in Terms of Hoare's Logic. | Jan A. Bergstra, J. Terlouw |
| 1981 | ICALP | Algebraically Specified Programming Systems and Hoare's Logic. | Jan A. Bergstra, John V. Tucker |
| 1981 | MFCS | On the Power of Algebraic Specifications. | Jan A. Bergstra, Manfred Broy, John V. Tucker, Martin Wirsing |
| 1980 | ICALP | A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. | Jan A. Bergstra, John V. Tucker |
| 1979 | FCT | Implicit definability of algebraic structures by means of program properties. | Jan A. Bergstra, Jerzy Tiuryn |
| 1978 | MFCS | Decision Problems Concerning Parallel Programming. | Jan A. Bergstra |
| 1977 | FCT | An Axiomatization of the Rational Data Objects. | Jan A. Bergstra, Alexander Ollongren, Theo P. van der Weide |