Rate My Professor Bas Luttik

Luttik's main research area is concurrency theory, particularly process algebra, providing a mathematical foundation for verifying system behavior. His work focuses on unique parallel decomposition and finite basis problems in process algebra, the integration of concurrency theory with classical automata theory—leading to a theory of executability based on Reactive Turing Machines—and the application of process-algebra-based formal methods to improve system requirements, notably in the railway domain. Key publications include "Non finite axiomatisability of weak bisimulation-based congruences" (Theoretical Computer Science, 2025, with Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir), "Axiomatising weak bisimulation congruences over CCS with left merge and communication merge" (Theoretical Computer Science, 2025, with Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir), "From Bisimulation to Traces" (CONCUR 2025, with Valentina Castiglioni), "Progress, Justness and Fairness in Modal µ-Calculus Formulae" (CONCUR 2024, with Tim A.C. Willemse), "Four Formal Models of IEEE 1394 Link Layer" (2024, with Hubert Garavel), "Sequential Value Passing Yields a Kleene Theorem for Processes" (2024, with Jos C.M. Baeten), and "Off-the-shelf automated analysis of liveness properties for just paths" (Acta Informatica, 2020, with Mark Bouwman and Tim Willemse). In 2018, he received the FMICS Best Paper Award with Tim A.C. Willemse. Luttik has served on program committees for CONCUR, EXPRESS/SOS (co-chair 2011, 2012, 2013), TTCS, ICE, and YR-CONCUR. His research has accumulated 687 citations according to Scopus.