| 2021 | CALCO | Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. | Jos C. M. Baeten, Cesare Carissimo, Bas Luttik |
| 2020 | CONCUR | CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). | Luca Aceto, Jos C. M. Baeten, Patricia Bouyer-Decitre, Holger Hermanns, Alexandra Silva |
| 2019 | CALCO | Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity. | Astrid Belder, Bas Luttik, Jos C. M. Baeten |
| 2012 | CONCUR | Turing Meets Milner. | Jos C. M. Baeten, Bas Luttik, Paul van Tilburg |
| 2012 | IFM | Partially-Supervised Plants: Embedding Control Requirements in Plant Components. | Jasen Markovski, Dirk A. van Beek, Jos C. M. Baeten |
| 2011 | FCT | Reactive Turing Machines. | Jos C. M. Baeten, Bas Luttik, Paul van Tilburg |
| 2011 | ICDCIT | Computations and Interaction. | Jos C. M. Baeten, Bas Luttik, Paul van Tilburg |
| 2008 | CONCUR | A Context-Free Process as a Pushdown Automaton. | Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. van Tilburg |
| 2006 | CONCUR | A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification. | Suzana Andova, Jos C. M. Baeten, Tim A. C. Willemse |
| 2005 | CONCUR | A Ground-Complete Axiomatization of Finite State Processes in Process Algebra. | Jos C. M. Baeten, Mario Bravetti |
| 2005 | LICS | Regular Expressions in Process Algebra. | Jos C. M. Baeten, Flavio Corradini |
| 2002 | STACS | Axiomatizing GSOS with Termination. | Jos C. M. Baeten, Erik P. de Vink |
| 2001 | SAC | Specifying internet applications with DiCons. | Jos C. M. Baeten, Harm M. A. van Beek, Sjouke Mauw |
| 2001 | TACAS | Abstraction in Probabilistic Process Algebra. | Suzana Andova, Jos C. M. Baeten |
| 1997 | CONCUR | Bounded Stacks, Bags and Queues. | Jos C. M. Baeten, Jan A. Bergstra |
| 1995 | FCT | Discrete Time Process Algebra with Abstraction. | Jos C. M. Baeten, Jan A. Bergstra |
| 1994 | CONCUR | Process Algebra with Partial Choice. | Jos C. M. Baeten, Jan A. Bergstra |
| 1994 | FORTE | Delayed choice: an operator for joining Message Sequence Charts. | Jos C. M. Baeten, Sjouke Mauw |
| 1993 | CONCUR | Non Interleaving Process Algebra. | Jos C. M. Baeten, Jan A. Bergstra |
| 1993 | CONCUR | A Congruence Theorem for Structured Operational Semantics with Predicates. | Jos C. M. Baeten, Chris Verhoef |
| 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 |
| 1987 | ICALP | Another Look at Abstraction in Process Algebra (Extended Abstract). | Jos C. M. Baeten, Rob J. van Glabbeek |