In Journals

• Reactive Turing Machines (with Jos Baeten and Paul van Tilburg).
  arXiv:1104.1738.
  (Full version will appear in Information & Computation; extended abstract appeared in Proceedings of FCT 2011, LNCS 6914, pp. 348-359.)
• Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (with Jos Baeten, Tim Muller and Paul van Tilburg).
  arXiv:1104.1738.
  Mathematical Structures in Computer Science (to appear), Copyright © 2013 Cambridge University Press.
• Unguardedness Mostly Means Many Solutions (with Jos Baeten).
  Theoretical Computer Science 412:3090-3100, Copyright © 2011 Elsevier B.V. .
  [pdf, BibTeX].
• On the Axiomatizability of Priority II (with Luca Aceto, Taolue Chen, Anna Ingolfsdottir, and Jaco van de Pol).
  Theoretical Computer Science 412:3035-3044, Copyright © 2011 Elsevier B.V. .
  [pdf, BibTeX].
• Towards model checking executable UML specifications in mCRL2 (with Helle Hvid Hansen, Jeroen Ketema, MohammadReza Mousavi, and Jaco van de Pol).
  Innovations in Systems and Software Engineering 6(1-2):83-90, Copyright © 2010 Springer-Verlag.
  [pdf, BibTeX].
• Computation Tree Logic with Deadlock Detection (with Rob van Glabbeek and Nikola Trcka).
  Logical Methods in Computer Science 5(4:5):1-24, Copyright © 2009 Creative Commons.
  [pdf, BibTeX].
• Branching bisimilarity with explicit divergence (with Rob van Glabbeek and Nikola Trcka).
  Fundamenta Informaticae 93(4):371-392, Copyright © 2009 IOS Press.
  [pdf, BibTeX].
• A finite equational base for CCS with left merge and communication merge (with Luca Aceto, Wan Fokkink and Anna Ingolfsdottir).
  Transactions on Computational Logic 10(1:6), Copyright © 2009 IOS Press.
  [pdf, BibTeX].
• The Equational Theory of Prebisimilarity over Basic CCS with Divergence (with Luca Aceto, Silvio Capobianco and Anna Ingolfsdottir).
  Information Processing Letters 108(5):284-289. Copyright © 2008 Elsevier Inc.
  [pdf, BibTeX].
• On finite alphabets and infinite bases (with Taolue Chen, Wan Fokkink and Sumit Nain).
  Information and Computation 206(5):492-519, 2008, Copyright © 2008 Elsevier Inc.
  [pdf, BibTeX].
• Analyzing a χ model of a turntabel system using Spin, CADP and UPPAAL (with E. Bortnik, N. Trcka, A.J. Wijs, J.M. van de Mortel-Fronczak, J.C.M. Baeten, W.J. Fokkink and J.E. Rooda).
  Journal of Logic and Algebraic Programming 65(2):51-104, 2005, Copyright © 2005 Elsevier Inc.
  [BibTeX].
• Decomposition orders - another generalisation of the fundamental theorem of arithmetic (with Vincent van Oostrom).
  Theoretical Computer Science, 335(2-3):147-186, 2005, Copyright © 2005 Elsevier Inc.
  [pdf, BibTeX].
• Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge (with Luca Aceto, Wan Fokkink and Anna Ingolfsdottir).
  Logical Methods in Computer Science 1 (1:3), 2005.
  [pdf, BibTeX].
• CCS with Hennessy's merge has no finite equational axiomatization (with Luca Aceto, Wan Fokkink and Anna Ingólfsdóttir).
  Theoretical Computer Science, 330(3):377-405, 2005, Copyright © 2005 Elsevier Inc.
  [pdf, BibTeX].
• Remarks on Thatte's Transformation of Term Rewriting Systems (with Piet Rodenburg and Rakesh Verma).
  Information and Computation, 195:66-87, 2004, Copyright © 2004 Elsevier Inc.
  [pdf, BibTeX].
• On the expressiveness of choice quantification.
  Annals of Pure and Applied Logic, 121:39-87, 2003, Copyright © 2003 Elsevier Inc.
  [pdf, BibTeX].

In Proceedings

• Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics.
  In: Jos C. M. Baeten and Thomas Ball and Frank S. de Boer, editors, Proceedings of IFIP TCS 2012, LNCS 7604, pp. 250-264. Copyright © Springer-Verlag 2012.
  Full version available at arXiv:1205.2117.
  [BibTeX].
• Turing Meets Milner (with Jos Baeten and Paul van Tilburg).
  In: Maciej Koutny and Irek Ulidowski, editors, Proceedings of CONCUR 2012, LNCS 7454, pp. 1-20. Copyright © Springer-Verlag 2012.
  [pdf, BibTeX].
• Automated verification of Executable UML models (with Helle Hvid Hansen, Jeroen Ketema, Mohammad Mousavi, Jaco van de Pol, and Osmar Marchi dos Santos).
  In: Bernhard K. Aichernig, Frank S. de Boer and Marcello M. Bonsangue, editors, Proceedings of 9th Symposium on Formal Methods for Components and Objects (FMCO 2010), LNCS 6957, pp. 225-250. Copyright © Springer-Verlag 2012.
  [pdf].
• Reactive Turing Machines (with Jos Baeten and Paul van Tilburg).
  In: Olaf Owe, Martin Steffen, and Jan Arne Telle, editors, Proceedings of 18th International Symposium on the Fundamentals of Computation Theory (FCT 2011), LNCS 6914, pp. 348-359, 2011. Copyright © Springer-Verlag 2011.
  A full version of this extended abstract is available as CoRR abs/1104.1738
  [pdf, BibTeX].
• A Process-Theoretic Approach to Supervisory Control Theory (with Jos Baeten, Bert van Beek, Jasen Markovski, and Koos Rooda).
  In: Proceedings of ACC 2011, to appear 2011
  [pdf, ].
• Computations and Interaction (with Jos Baeten and Paul van Tilburg).
  In: Raja Natarajan and Adegboyega K. Ojo, editors, 7th International Conference on Distributed Computing and Internet Technology (ICDCIT 2011), LNCS 6536, pp. 35-54, 2011, Copyright © Springer-Verlag 2011.
  [pdf, BibTeX].
• Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (with Jos Baeten, Tim Muller and Paul van Tilburg).
  In: Sibylle Froeschle and Frank Valencia, editors, Proceedings 17th International Workshop on Expressiveness in Concurrency (EXPRESS'10), EPTCS 41, pp. 1-15, 2010.
  [pdf, BibTeX].
• A Process-Theoretic Look at Automata (with Jos Baeten, Pieter Cuijpers and Paul van Tilburg).
  In: Farhad Arbab and Marjan Sirjani, editors, 3rd International Conference on Fundamentals of Software Engineering (FSEN'09), LNCS 5961, pp. 1-33, 2010, Copyright © 2010, Springer-Verlag.
  [pdf, BibTeX].
• Finite Equational Bases for Fragments of CCS with Restriction and Relabelling (with Luca Aceto, Anna Ingolfdottir and Paul van Tilburg).
  In: Giorgio Ausiello, Juhani Karhum\"aki, Giancarlo Mauri and Luce Ong, editors, Proceedings of Fifth IFIP International Conference on Theoretical Computer Science (TCS 2008), volume 273 of IFIP International Federation for Information Processing, pp. 317-332, Copyright © 2006, Springer Boston.
  [pdf, BibTeX].
• Some Remarks on Definability of Process Graphs (with Clemens Grabmayer and Jan Willem Klop).
  In: Christel Baier and Holger Hermanns, editors, Proceedings of CONCUR 2006, LNCS 4137, pp. 16-36, August 2006, Copyright © 2006 Springer-Verlag.
  [pdf, BibTeX].
• A finite equational base for CCS with left merge and communication merge (with Luca Aceto, Wan Fokkink and Anna Ingolfsdottir).
  In: Michele Bugliesi, Bart Preneel, Vladimiro Sassone and Ingo Wegener, editors, Proceedings of ICALP 2006, LNCS 4052, pp. 492-503, July 2006, Copyright © 2006 Springer-Verlag.
  [pdf, BibTeX].
• Finite equational bases in process algebra: results and open questions (with Luca Aceto, Wan Fokkink and Anna Ingólfsdóttir).
  In: Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk and Roel de Vrijer, editors, Processes, Terms and Cycles: Steps on the Road to Infinity (essays dedicated to Jan Willem Klop on the Occasion of His 60th Birthday), LNCS 3838, pp. 338-367, 2005, Copyright © 2005 Springer-Verlag.
  [pdf, BibTeX].
• Stuttering congruence for χ (with Nikola Trcka).
  In: P. Godefroid, editor, Proceedings of SPIN 2005, LNCS 3639, pp. 185-199, August 2005, Copyright © 2005 Springer-Verlag.
  [pdf, BibTeX].
• A unique decomposition theorem for ordered monoids with applications in process theory (extended abstract).
  In: Branislav Rovan and Peter Vojtas, editors, Proceedings of MFCS 2003, LNCS 2747, pp. 562-571, August 2003, Copyright © 2003 Springer-Verlag.
  [pdf, BibTeX].
• An omega-complete equational specification of interleaving (extended abstract) (with Wan Fokkink).
  In: Ugo Montanari, José D.P. Rolim and Emo Welzl, editors, Proceedings of ICALP 2000, LNCS 1853, pp. 729-743, July 2000, Copyright © 2000 Springer-Verlag.
  [pdf, BibTeX].
• Specification of rewriting strategies (with Eelco Visser).
  In: Alex Sellink, editor, Proceedings of the 2nd International Workshop on the Theory and Practice of Algebraic Specification (ASF+SDF'97). Electronic Workshops in Computing, Springer-Verlag, Berlin, November, 1997.
  [ps.gz, BibTeX].
• Description and formal specification of the Link Layer of P1394.
  In: Ignac Lovrek, editor, Proceedings of the 2nd International Workshop on Applied Formal Methods in System Design, pp. 43-56, University of Zagreb, Croatia, June 1997. Also available as Report SEN-R9706, CWI, The Netherlands.

Thesis

• Choice quantification in process algebra
  Ph.D. Thesis, University of Amsterdam, April 2002.
  [pdf, BibTeX].

Miscellaneous

• When Turing Meets Milner (with Jos Baeten and Paul van Tilburg).
  ERCIM News 91 (special theme: What is Computation? Alan Turing's Legacy), pp. 11-12, October 2012.
• What is algebraic in process theory?
  In: Luca Aceto, editor, The Concurrency Column, Bulletin of the EATCS 88, February 2006.
  This is an extended version of an essay [pdf] that appeared in: Luca Aceto and Andrew Gordon, editors, Proceedings of the Workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond (APC 25), ENTCS 162, pp. 227-231, September 2006, Copyright © Elsevier 2006 Inc.
  Slides for my talk at the workshop [pdf].
  [pdf]
• Guest editors' introduction: special issue on process theory for hybrid systems (with Jos Baeten).
  Journal of Logic and Algebraic Programming 68(1-2):1-3, 2006, Copyright © 2006 Elsevier Inc.
  [BibTeX].
• Reflections on a Geometry of Processes (with Clemens Grabmayer and Jan Willem Klop).
  In: Luca Aceto and Andrew Gordon, editors, Proceedings of the Workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond (APC 25), ENTCS 162, pp. 183-190, September 2006, Copyright © Elsevier 2006 Inc.
  [pdf].
• How can I be sure that my DVD player understands my TV? (with Wan Fokkink, Izak van Langevelde and Yaroslav Usenko).
  ERCIM News 47 (special issue on ambient intelligence), 34-35, October 2001.

Technical Reports

• A Finite Equational Base for CCS with Left Merge and Communication Merge (with Luca Aceto, Wan Fokkink and Anna Ingólfsdóttir).
  Report RS-06-6, BRICS, University of Aarhus, Denmark, January 2006.
  
• Decomposition Orders - another generalisation of the fundamental theorem of arithmetic (with Vincent van Oostrom).
  Report SEN-R0414, CWI, The Netherlands, September 2004.
  
• Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge (with Luca Aceto, Wan Fokkink and Anna Ingólfsdóttir).
  Report RS-04-1, BRICS, University of Aarhus, Denmark, January 2004.
  
• CCS with Hennessy's merge has no finite equational axiomatization (with Luca Aceto, Wan Fokkink and Anna Ingólfsdóttir).
  Report RS-03-34, BRICS, University of Aarhus, Denmark, November 2003.
  
• Complete axiomatisations of weak-, delay- and eta-bisimulation for process algebras with alternative quantification over data.
  Report SEN-R9914, CWI, The Netherlands.
• Cylindric process algebras with conditionals give substitutionless pCRL.
  Report SEN-R9912, CWI, The Netherlands.
• A complete axiomatisation of branching bisimulation for process algebras with alternative quantification over data (with Jan Friso Groote).
  Report SEN-R9830, CWI, The Netherlands.
• Undecidability and completeness results for process algebras with alternative quantification over data (with Jan Friso Groote).
  Report SEN-R9806, CWI, The Netherlands. A summary of this paper is also available.
• Transformations of reduction systems (with Piet Rodenburg).
  Report P9615, Programming Research Group, University of Amsterdam, The Netherlands. This report was a revised version of my Master's Thesis.