Editorial. - Jan Friso Groote; Bas Luttik; Jos van Wamel (Formal Aspects Comput., 1998)

An omega-Complete Equational Specification of Interleaving. - Wan J. Fokkink; S. P. Luttik (ICALP, 2000)

A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory. - Bas Luttik (MFCS, 2003)

On the expressiveness of choice quantification. - Bas Luttik (Ann. Pure Appl. Log., 2003)

Remarks on Thatte's transformation of term rewriting systems. - Bas Luttik; Piet Rodenburg; Rakesh M. Verma (Inf. Comput., 2004)

Finite Equational Bases in Process Algebra: Results and Open Questions. - Luca Aceto; Wan J. Fokkink; Anna Ingólfsdóttir; Bas Luttik (Processes, Terms and Cycles, 2005)

Stuttering Congruence for chi. - Bas Luttik; Nikola Trcka (SPIN, 2005)

Reflections on a Geometry of Processes. - Clemens Grabmayer; Jan Willem Klop; Bas Luttik (APC 25, 2005)

What is algebraic in process theory? - Bas Luttik (APC 25, 2005)

Analyzing a chi model of a turntable system using Spin, CADP and Uppaal. - Elena M. Bortnik; Nikola Trcka; Anton Wijs; Bas Luttik; Joanna M. van de Mortel-Fronczak; Jos C. M. Baeten; Wan J. Fokkink; Jacobus E. Rooda (J. Log. Algebraic Methods Program., 2005)

Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge. - Luca Aceto; Wan J. Fokkink; Anna Ingólfsdóttir; Bas Luttik (Log. Methods Comput. Sci., 2005)

CCS with Hennessy's merge has no finite-equational axiomatization. - Luca Aceto; Wan J. Fokkink; Anna Ingólfsdóttir; Bas Luttik (Theor. Comput. Sci., 2005)

Decomposition orders another generalisation of the fundamental theorem of arithmetic. - Bas Luttik; Vincent van Oostrom (Theor. Comput. Sci., 2005)

Some Remarks on Definability of Process Graphs. - Clemens Grabmayer; Jan Willem Klop; Bas Luttik (CONCUR, 2006)

Guest editors' introduction: Special issue on Process Theory for Hybrid Systems. - Jos C. M. Baeten; S. P. Luttik (J. Log. Algebraic Methods Program., 2006)

Finite Equational Bases for Fragments of CCS with Restriction and Relabelling. - Luca Aceto; Anna Ingólfsdóttir; Bas Luttik; Paul van Tilburg (IFIP TCS, 2008)

On finite alphabets and infinite bases. - Taolue Chen 001; Wan J. Fokkink; Bas Luttik; Sumit Nain (Inf. Comput., 2008)

The equational theory of prebisimilarity over basic CCS with divergence. - Luca Aceto; Silvio Capobianco; Anna Ingólfsdóttir; Bas Luttik (Inf. Process. Lett., 2008)

A Process-Theoretic Look at Automata. - Jos C. M. Baeten; Pieter J. L. Cuijpers; Bas Luttik; P. J. A. van Tilburg (FSEN, 2009)

Computation Tree Logic with Deadlock Detection - Rob J. van Glabbeek; Bas Luttik; Nikola Trcka (Log. Methods Comput. Sci., 2009)

Branching Bisimilarity with Explicit Divergence. - Rob J. van Glabbeek; Bas Luttik; Nikola Trcka (Fundam. Informaticae, 2009)

A finite equational base for CCS with left merge and communication merge. - Luca Aceto; Wan J. Fokkink; Anna Ingólfsdóttir; Bas Luttik (ACM Trans. Comput. Log., 2009)

Automated Verification of Executable UML Models. - Helle Hvid Hansen; Jeroen Ketema; Bas Luttik; Mohammad Reza Mousavi 001; Jaco van de Pol; Osmar Marchi dos Santos (FMCO, 2010)

Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) - Jos C. M. Baeten; Bas Luttik; Tim Muller; Paul van Tilburg (EXPRESS, 2010)

Towards model checking executable UML specifications in mCRL2. - Helle Hvid Hansen; Jeroen Ketema; Bas Luttik; Mohammad Reza Mousavi 001; Jaco van de Pol (Innov. Syst. Softw. Eng., 2010)

A process-theoretic approach to supervisory control theory. - Jos C. M. Baeten; D. A. van Beek; Bas Luttik; Jasen Markovski; Jacobus E. Rooda (ACC, 2011)

Computations and Interaction. - Jos C. M. Baeten; Bas Luttik; Paul van Tilburg (ICDCIT, 2011)

On the axiomatizability of priority II. - Luca Aceto; Taolue Chen 001; Anna Ingólfsdóttir; Bas Luttik; Jaco van de Pol (Theor. Comput. Sci., 2011)

Unguardedness mostly means many solutions. - Jos C. M. Baeten; Bas Luttik (Theor. Comput. Sci., 2011)

Turing Meets Milner. - Jos C. M. Baeten; Bas Luttik; Paul van Tilburg (CONCUR, 2012)

When Turing Meets Milner. - Jos C. M. Baeten; Bas Luttik; Paul van Tilburg (ERCIM News, 2012)

Proof Graphs for Parameterised Boolean Equation Systems. - Sjoerd Cranen; Bas Luttik; Tim A. C. Willemse (CONCUR, 2013)

Reactive Turing machines. - Jos C. M. Baeten; Bas Luttik; Paul van Tilburg (Inf. Comput., 2013)

Executable Behaviour and the $π$-Calculus. - Bas Luttik; Fei Yang (CoRR, 2014)

Evidence for Fixpoint Logic. - Sjoerd Cranen; Bas Luttik; Tim A. C. Willemse (CSL, 2015)

Executable Behaviour and the π-Calculus (extended abstract). - Bas Luttik; Fei Yang (ICE, 2015)

On the Executability of Interactive Computation. - Bas Luttik; Fei Yang (CiE, 2016)

Unique Parallel Decomposition for the Pi-calculus. - Matias David Lee; Bas Luttik (EXPRESS/SOS, 2016)

Expressiveness modulo bisimilarity of regular expressions with parallel composition. - Jos C. M. Baeten; Bas Luttik; Tim Muller; Paul van Tilburg (Math. Struct. Comput. Sci., 2016)

Preface to special issue: EXPRESS 2011. - Bas Luttik; Frank D. Valencia (Math. Struct. Comput. Sci., 2016)

Unique parallel decomposition in branching and weak bisimulation semantics. - Bas Luttik (Theor. Comput. Sci., 2016)

Divide and Congruence III: Stability & Divergence. - Wan J. Fokkink; Rob J. van Glabbeek; Bas Luttik (CONCUR, 2017)

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages. - Tobias Kappé; Paul Brunet; Bas Luttik; Alexandra Silva 001; Fabio Zanasi (CONCUR, 2017)

Sequential Composition in the Presence of Intermediate Termination. - Jos C. M. Baeten; Bas Luttik; Fei Yang (CoRR, 2017)

Sequential Composition in the Presence of Intermediate Termination (Extended Abstract). - Jos C. M. Baeten; Bas Luttik; Fei Yang (EXPRESS/SOS, 2017)

Modelling and Analysing ERTMS Hybrid Level 3 with the mCRL2 Toolset. - Maarten Bartholomeus; Bas Luttik; Tim A. C. Willemse (FMICS, 2018)

Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity. - Astrid Belder; Bas Luttik; Jos C. M. Baeten (CALCO, 2019)

Modelling and Analysing Software in mCRL2. - Jan Friso Groote; Jeroen J. A. Keiren; Bas Luttik; Erik P. de Vink; Tim A. C. Willemse (FACS, 2019)

Formal Modelling and Verification of an Interlocking Using mCRL2. - Mark Bouwman; Bob Janssen; Bas Luttik (FMICS, 2019)

Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence. - Wan J. Fokkink; Rob van Glabbeek; Bas Luttik (Inf. Comput., 2019)

On series-parallel pomset languages: Rationality, context-freeness and automata. - Tobias Kappé; Paul Brunet; Bas Luttik; Alexandra Silva 001; Fabio Zanasi (J. Log. Algebraic Methods Program., 2019)

On the Axiomatisability of Parallel Composition: A Journey in the Spectrum. - Luca Aceto; Valentina Castiglioni; Anna Ingólfsdóttir; Bas Luttik; Mathias Ruggaard Pedersen (CONCUR, 2020)

Up-to Techniques for Branching Bisimilarity. - Rick Erkens; Jurriaan Rot; Bas Luttik (SOFSEM, 2020)

Off-the-shelf automated analysis of liveness properties for just paths. - Mark Bouwman; Bas Luttik; Tim A. C. Willemse (Acta Informatica, 2020)

Divergence-Preserving Branching Bisimilarity. - Bas Luttik (EXPRESS/SOS, 2020)

A process algebra with global variables. - Mark Bouwman; Bas Luttik; Wouter Schols; Tim A. C. Willemse (EXPRESS/SOS, 2020)

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence. - Rob van Glabbeek; Bas Luttik; Linda Spaninks (Log. Methods Comput. Sci., 2020)

On the axiomatisability of priority III: Priority strikes again. - Luca Aceto; Elli Anastasiadi; Valentina Castiglioni; Anna Ingólfsdóttir; Bas Luttik; Mathias Ruggaard Pedersen (Theor. Comput. Sci., 2020)

Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition? - Luca Aceto; Valentina Castiglioni; Wan J. Fokkink; Anna Ingólfsdóttir; Bas Luttik (CSL, 2021)

A Formalisation of SysML State Machines in mCRL2. - Mark Bouwman; Bas Luttik; Djurre van der Wal (FORTE, 2021)

Off-the-Shelf Automated Analysis of Liveness Properties for Just Paths - (Extended Abstract). - Mark Bouwman; Bas Luttik; Tim A. C. Willemse (FORTE, 2021)

In search of lost time: Axiomatising parallel composition in process algebras. - Luca Aceto; Elli Anastasiadi; Valentina Castiglioni; Anna Ingólfsdóttir; Bas Luttik (LICS, 2021)

Equivalence checking for weak bi-Kleene algebra. - Tobias Kappé; Paul Brunet; Bas Luttik; Alexandra Silva 001; Fabio Zanasi (Log. Methods Comput. Sci., 2021)

The π-Calculus is Behaviourally Complete and Orbit-Finitely Executable. - Bas Luttik; Fei Yang (Log. Methods Comput. Sci., 2021)

On the Axiomatisation of Branching Bisimulation Congruence over CCS. - Luca Aceto; Valentina Castiglioni; Anna Ingólfsdóttir; Bas Luttik (CONCUR, 2022)

Decompositional Branching Bisimulation Minimisation of Monolithic Processes. - Mark Bouwman; Maurice Laveaux; Bas Luttik; Tim A. C. Willemse (FACS, 2022)

Supporting Railway Innovations with Formal Modelling and Verification. - Bas Luttik (FMICS, 2022)

Safe and Secure Future AI-Driven Railway Technologies: Challenges for Formal Methods in Railway. - Monika Seisenberger; Maurice H. ter Beek; Xiuyi Fan; Alessio Ferrari 001; Anne E. Haxthausen; Phillip James; Andrew Lawrence; Bas Luttik; Jaco van de Pol; Simon Wimmer 001 (ISoLA (4), 2022)

On the Axiomatisability of Parallel Composition. - Luca Aceto; Valentina Castiglioni; Anna Ingólfsdóttir; Bas Luttik; Mathias Ruggaard Pedersen (Log. Methods Comput. Sci., 2022)

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? - Luca Aceto; Valentina Castiglioni; Wan J. Fokkink; Anna Ingólfsdóttir; Bas Luttik (ACM Trans. Comput. Log., 2022)

Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers. - Myrthe S. C. Spronck; Bas Luttik (CONCUR, 2023)

Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract). - Jos C. M. Baeten; Bas Luttik (EXPRESS/SOS, 2023)

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. - Jos C. M. Baeten; Cesare Carissimo; Bas Luttik (Log. Methods Comput. Sci., 2023)

A Case in Point: Verification and Testing of a EULYNX Interface. - Mark Bouwman; Djurre van der Wal; Bas Luttik; Mariëlle Stoelinga; Arend Rensink (Formal Aspects Comput., 2023)

Sequential Value Passing Yields a Kleene Theorem for Processes. - Jos C. M. Baeten; Bas Luttik (Logics and Type Systems in Theory and Practice, 2024)

Progress, Justness and Fairness in Modal μ-Calculus Formulae. - Myrthe S. C. Spronck; Bas Luttik; Tim A. C. Willemse (CONCUR, 2024)

Four Formal Models of IEEE 1394 Link Layer. - Hubert Garavel; Bas Luttik (MARS@ETAPS, 2024)

Just Verification of Mutual Exclusion Algorithms. - Rob van Glabbeek; Bas Luttik; Myrthe S. C. Spronck (CONCUR, 2025)

From Bisimulation to Traces: The Impact of Parallel Composition on Finite Bases. - Rowin Versteeg; Valentina Castiglioni; Bas Luttik (CONCUR, 2025)

Axiomatising weak bisimulation congruences over CCS with left merge and communication merge. - Luca Aceto; Valentina Castiglioni; Anna Ingólfsdóttir; Bas Luttik (Theor. Comput. Sci., 2025)

Non finite axiomatisability of weak bisimulation-based congruences. - Luca Aceto; Valentina Castiglioni; Anna Ingólfsdóttir; Bas Luttik (Theor. Comput. Sci., 2025)

The Queue Automaton Revisited. - Jos C. M. Baeten; Bas Luttik (CoRR, 2025)