| 2024 | CONCUR | Branching Bisimilarity for Processes with Time-Outs. | Gaspard Reghem, Rob J. van Glabbeek |
| 2018 | IFM | Analysing AWN-Specifications Using mCRL2 (Extended Abstract). | Rob J. van Glabbeek, Peter Hfner, Djurre van der Wal |
| 2017 | CONCUR | Divide and Congruence III: Stability & Divergence. | Wan J. Fokkink, Rob J. van Glabbeek, Bas Luttik |
| 2017 | CSL | Precongruence Formats with Lookahead through Modal Decomposition. | Wan J. Fokkink, Rob J. van Glabbeek |
| 2017 | LICS | Lean and full congruence formats for recursion. | Rob J. van Glabbeek |
| 2016 | ESOP | A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract). | Emile Bres, Rob J. van Glabbeek, Peter Hfner |
| 2016 | LICS | Divide and Congruence II: Delay and Weak Bisimilarity. | Wan J. Fokkink, Rob J. van Glabbeek |
| 2014 | ATVA | A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol. | Timothy Bourke, Rob J. van Glabbeek, Peter Hfner |
| 2014 | ITP | Showing Invariance Compositionally for a Process Algebra for Network Protocols. | Timothy Bourke, Rob J. van Glabbeek, Peter Hfner |
| 2013 | MSWIM | Sequence numbers do not guarantee loop freedom: AODV can yield routing loops. | Rob J. van Glabbeek, Peter Hfner, Wee Lum Tan, Marius Portmann |
| 2012 | ESOP | A Process Algebra for Wireless Mesh Networks. | Ansgar Fehnker, Rob J. van Glabbeek, Peter Hfner, Annabelle McIver, Marius Portmann, Wee Lum Tan |
| 2012 | FOSSACS | On Distributability of Petri Nets - (Extended Abstract). | Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann |
| 2012 | MSWIM | A rigorous analysis of AODV and its variants. | Peter Hfner, Rob J. van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle McIver, Ansgar Fehnker |
| 2012 | TACAS | Automated Analysis of AODV Using UPPAAL. | Ansgar Fehnker, Rob J. van Glabbeek, Peter Hfner, Annabelle McIver, Marius Portmann, Wee Lum Tan |
| 2011 | CONCUR | On Causal Semantics of Petri Nets. | Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke |
| 2010 | LPAR | Characterising Probabilistic Processes Logically - (Extended Abstract). | Yuxin Deng, Rob J. van Glabbeek |
| 2009 | CONCUR | Testing Finitary Probabilistic Processes. | Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan |
| 2009 | SOFSEM | On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. | Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek |
| 2008 | CAV | Correcting a Space-Efficient Simulation Algorithm. | Rob J. van Glabbeek, Bas Ploeger |
| 2008 | MFCS | On Synchronous and Asynchronous Interaction in Distributed Systems. | Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke |
| 2007 | ESOP | Scalar Outcomes Suffice for Finitary Probabilistic Testing. | Yuxin Deng, Rob J. van Glabbeek, Carroll Morgan, Chenyi Zhang |
| 2007 | LICS | Characterising Testing Preorders for Finite Probabilistic Processes. | Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang |
| 2006 | CONCUR | Liveness, Fairness and Impossible Futures. | Rob J. van Glabbeek, Marc Voorhoeve |
| 2005 | CONCUR | The Individual and Collective Token Interpretations of Petri Nets. | Rob J. van Glabbeek |
| 2005 | ICTAC | On Cool Congruence Formats for Weak Bisimulations. | Rob J. van Glabbeek |
| 2004 | MFCS | Event Structures for Resolvable Conflict. | Rob J. van Glabbeek, Gordon D. Plotkin |
| 2003 | BPM | Query Nets: Interacting Workflow Modules That Ensure Global Termination. | Rob J. van Glabbeek, David G. Stork |
| 2003 | CONCUR | Bundle Event Structures and CCSP. | Rob J. van Glabbeek, Frits W. Vaandrager |
| 2003 | FCT | Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. | Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind |
| 2003 | LICS | Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract). | Dominic J. D. Hughes, Rob J. van Glabbeek |
| 2000 | LICS | Precongruence Formats for Decorated Trace Preorders. | Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek |
| 1999 | CONCUR | Petri Nets, Configuration Structures and Higher Dimensional Automata. | Rob J. van Glabbeek |
| 1997 | CONCUR | Axiomatizing Flat Iteration. | Rob J. van Glabbeek |
| 1996 | ICALP | The Meaning of Negative Premises in Transition System Specifications II. | Rob J. van Glabbeek |
| 1995 | LICS | Configuration Structures | Rob J. van Glabbeek, Gordon D. Plotkin |
| 1993 | CONCUR | The Linear Time - Branching Time Spectrum II. | Rob J. van Glabbeek |
| 1993 | MFCS | A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours. | Rob J. van Glabbeek |
| 1990 | CONCUR | The Linear Time-Branching Time Spectrum (Extended Abstract). | Rob J. van Glabbeek |
| 1990 | LICS | Reactive, Generative, and Stratified Models of Probabilistic Processes | Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen, Chris M. N. Tofts |
| 1989 | MFCS | Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract). | Rob J. van Glabbeek, Ursula Goltz |
| 1987 | ICALP | Another Look at Abstraction in Process Algebra (Extended Abstract). | Jos C. M. Baeten, Rob J. van Glabbeek |
| 1987 | STACS | Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra. | Rob J. van Glabbeek |