By Dr Rob van Glabbeek

Journal articles

Fokkink W; van Glabbeek RJ, 2008, 'Ready to preorder: The case of weak process semantics', Information Processing Letters, 109, pp. 104 - 111

van Glabbeek R; Mosses PD, 2007, 'Preface', Electronic Notes in Theoretical Computer Science, 175, pp. 1 - 2, http://dx.doi.org/10.1016/j.entcs.2006.11.016

van Glabbeek RJ, 2007, 'Preface', Electronic Notes in Theoretical Computer Science, 75

van Glabbeek RJ; Hennessy M, 2007, 'Preface', Electronic Notes in Theoretical Computer Science, 192

Deng Y; van Glabbeek RJ; Hennessy M; Morgan CC; Zhang C, 2007, 'Remarks on Testing Probabilistic Processes', Electronic Notes in Theoretical Computer Science, 172, pp. 359 - 397, http://dx.doi.org/10.1016/j.entcs.2007.02.013

van Glabbeek RJ, 2006, 'Erratum to "On the expressiveness of higher dimensional automata". [Theoret. Comput. Sci. 356 (2006) 265-290] (DOI:10.1016/j.tcs.2006.02.012)', Theoretical Computer Science, 368, pp. 168 - 194, http://dx.doi.org/10.1016/j.tcs.2006.06.024

Fokkink W; Van Glabbeek R; De Wind P, 2006, 'Divide and congruence: From decomposition of modalities to preservation of branching bisimulation', Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 4111 LNCS, pp. 195 - 218, http://dx.doi.org/10.1007/11804192_10

Fokkink W; van Glabbeek RJ; de Wind P, 2006, 'Compositionality of Hennessy-Milner logic by structural operational semantics', Theoretical Computer Science, 354, pp. 421 - 440

van Glabbeek RJ, 2006, 'On Specifying Timeouts', Electronic Notes in Theoretical Computer Science, 162, pp. 173 - 175, http://dx.doi.org/10.1016/j.entcs.2005.12.083

van Glabbeek RJ, 2006, 'On the expressiveness of higher dimensional automata', Theoretical Computer Science, 356, pp. 265 - 290, http://dx.doi.org/10.1016/j.tcs.2006.02.012

van Glabbeek RJ, 2006, 'On the expressiveness of higher dimensional automata (vol 356, pg 265, 2006)', Theoretical Computer Science, 368, pp. 168 - 194

Van Glabbeek RJ, 2005, 'On cool congruence formats for weak bisimulations', Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 3722 LNCS, pp. 318 - 333, http://dx.doi.org/10.1007/11560647_21

van Glabbeek RJ; Hughes D, 2005, 'Proof nets for unit-free multiplicative additive linear logic', ACM Transactions on Computational Logic, 6 (4), pp. 784 - 842

Aceto L; Fokkink W; Van Glabbeek R; Ingólfsdóttir A, 2004, 'Nested semantics over finite trees are equationally hard', Information and Computation, 191, pp. 203 - 232, http://dx.doi.org/10.1016/j.ic.2004.02.001

Van Glabbeek R; Goltz U, 2004, 'Well-behaved flow event structures for parallel composition and action refinement', Theoretical Computer Science, 311, pp. 463 - 478, http://dx.doi.org/10.1016/j.tcs.2003.10.031

Van Glabbeek R; Plotkin G, 2004, 'Event structures for resolvable conflict', Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 3153, pp. 550 - 561, http://dx.doi.org/10.1007/978-3-540-28629-5_42

Bloom B; Fokkink W; Van Glabbeek RJ, 2004, 'Precongruence formats for decorated trace semantics', ACM Transactions on Computational Logic, 5, pp. 26 - 78, http://dx.doi.org/10.1145/963927.963929

Van Glabbeek RJ, 2004, 'The meaning of negative premises in transition system specifications II', Journal of Logic and Algebraic Programming, 60-61, pp. 229 - 258, http://dx.doi.org/10.1016/j.jlap.2004.03.007

Hughes D; Van Glabbeek R, 2003, 'Proof nets for unit-free multiplicative-additive linear logic', Proceedings Symposium on Logic in Computer Science, pp. 1 - 10

Aceto L; Fokkink WJ; Glabbeek RJV; Ingólfsdóttir A, 2003, 'Nested Semantics over Finite Trees are Equationally Hard', BRICS Report Series, 10, http://dx.doi.org/10.7146/brics.v10i27.21795

Van Glabbeek R; Vaandrager F, 2003, 'Bundle event structures and CCSP', Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2761, pp. 57 - 71, http://dx.doi.org/10.1007/978-3-540-45187-7_4

Fokkink W; Van Glabbeek R; De Wind P, 2003, 'Compositionality of Hennessy-Milner logic through structural operational semantics', Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2751, pp. 412 - 422, http://dx.doi.org/10.1007/978-3-540-45077-1_38

Van Glabbeek RJ; Stork DG, 2003, 'Query nets: Interacting workflow modules that ensure global termination', Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2678, pp. 184 - 199, http://dx.doi.org/10.1007/3-540-44895-0_13

Stork DG; Van Glabbeek R, 2002, 'Token-controlled place refinement in hierarchical petri nets with application to active document workflow', Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2360 LNCS, pp. 394 - 413, http://dx.doi.org/10.1007/3-540-48068-4_23

Van Glabbeek R; Goltz U, 2001, 'Refinement of actions and equivalence notions for concurrent systems', Acta Informatica, 37, pp. 229 - 327, http://dx.doi.org/10.1007/s002360000041

Palamidessi C; Parrow J; Van Glabbeek R, 2000, 'Information and Computation: Preface', Information and Computation, 156, pp. 1, http://dx.doi.org/10.1006/inco.1999.2815

Bloom B; Fokkink W; Van Glabbeek R, 2000, 'Precongruence formats for decorated trace preorders', Proceedings Symposium on Logic in Computer Science, pp. 107 - 118, http://dx.doi.org/10.1109/LICS.2000.855760

Van Glabbeek RJ, 1999, 'Petri nets, configuration structures, and higher dimensional automata', Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 1664 LNCS, pp. 21 - 27, http://dx.doi.org/10.1007/3-540-48320-9_3

Van Glabbeek R; Vaandrager F, 1997, 'The Difference between Splitting in n and n + 1', Information and Computation, 136, pp. 109 - 142, http://dx.doi.org/10.1006/inco.1997.2634

Van Glabbeek RJ, 1997, 'Notes on the methodology of CCS and CSP', Theoretical Computer Science, 177, pp. 329 - 349, http://dx.doi.org/10.1016/S0304-3975(96)00251-4

Aceto L; Van Glabbeek R; Fokkink W; Ingólfsdóttir A, 1996, 'Axiomatizing Prefix Iteration with Silent Steps', Information and Computation, 127, pp. 26 - 40, http://dx.doi.org/10.1006/inco.1996.0047

Fokkink W; Van Glabbeek R, 1996, 'Ntyft/ntyxt Rules Reduce to Ntree Rules', Information and Computation, 126, pp. 1 - 10, http://dx.doi.org/10.1006/inco.1996.0030

Van Glabbeek RJ; Weijland WP, 1996, 'Branching time and abstraction in bisimulation semantics', Journal of the ACM, 43, pp. 555 - 600, http://dx.doi.org/10.1145/233551.233556

Aceto L; Fokkink WJ; Glabbeek RJV; Ingólfsdóttir A, 1995, 'Axiomatizing Prefix Iteration with Silent Steps', BRICS Report Series, 2, http://dx.doi.org/10.7146/brics.v2i56.19957

van Glabbeek RJ; Plotkin GD, 1995, 'Configuration structures (extended abstract)', Proceedings Symposium on Logic in Computer Science, pp. 199 - 209

van Glabbeek R; Vaandrager F, 1993, 'Modular specification of process algebras', Theoretical Computer Science, 113, pp. 293 - 348, http://dx.doi.org/10.1016/0304-3975(93)90006-F

van Glabbeek R; Smolka SA; Steffen B; Tofts CMN, 1990, 'Reactive, generative, and stratified models of probabilistic processes', Proceedings Symposium on Logic in Computer Science, pp. 130 - 141

Baeten JCM; Van Glabbeek RJ, 1989, 'Abstraction and Empty Process in Process Algebra', Fundamenta Informaticae, 12, pp. 221 - 241, http://dx.doi.org/10.3233/fi-1989-12208

Conference Papers

Keskin O; Yoshida N; van Glabbeek R, 2026, 'Formally Verified Liveness with Multiparty Session Types in Rocq', in Leibniz International Proceedings in Informatics Lipics, http://dx.doi.org/10.4230/LIPIcs.ITP.2026.4

van Glabbeek R; Luttik B; Spronck MSC, 2025, 'Just Verification of Mutual Exclusion Algorithms', in Leibniz International Proceedings in Informatics Lipics, http://dx.doi.org/10.4230/LIPIcs.CONCUR.2025.17

van Glabbeek R, 2025, 'Unique Solutions of Guarded Recursive Equations', in Electronic Proceedings in Theoretical Computer Science Eptcs, pp. 65 - 84, http://dx.doi.org/10.4204/EPTCS.433.6

Amjad R; van Glabbeek R; O’Connor L, 2024, 'Semantics for Linear-time Temporal Logic with Finite Observations', in Electronic Proceedings in Theoretical Computer Science Eptcs, pp. 35 - 50, http://dx.doi.org/10.4204/EPTCS.412.4

Reghem G; van Glabbeek RJ, 2024, 'Branching Bisimilarity for Processes with Time-Outs', in Leibniz International Proceedings in Informatics Lipics, http://dx.doi.org/10.4230/LIPIcs.CONCUR.2024.36

van Glabbeek R; Groote JF; de Vink E, 2023, 'A Cancellation Law for Probabilistic Processes', in Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, Antwerp, Belgium, pp. 42 - 58, presented at Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics (EXPRESS/SOS 2023), Antwerp, Belgium, 18 September 2023, http://dx.doi.org/10.4204/EPTCS.387.5

van Glabbeek R; Höfner P; Wang W, 2023, 'A Lean-Congruence Format for EP-Bisimilarity', in Electronic Proceedings in Theoretical Computer Science Eptcs, pp. 59 - 75, http://dx.doi.org/10.4204/EPTCS.387.6

van Glabbeek R, 2022, 'Comparing the expressiveness of the π -calculus and CCS', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Munich, Germany, pp. 548 - 574, presented at 31st European Symposium on Programming, ESOP 2022, Munich, Germany, 02 April 2022 - 07 April 2022, http://dx.doi.org/10.1007/978-3-030-99336-8_20

van Glabbeek R; Höfner P; Horne R, 2021, 'Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom', Institute of Electrical and Electronics Engineers (IEEE), pp. 1 - 13, presented at 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), http://dx.doi.org/10.1109/lics52264.2021.9470531

van Glabbeek R, 2020, 'Reactive temporal logic', in Electronic Proceedings in Theoretical Computer Science Eptcs, pp. 51 - 68, http://dx.doi.org/10.4204/EPTCS.322.6

van Glabbeek R, 2020, 'Reactive bisimulation semantics for a process algebra with time-outs', in Leibniz International Proceedings in Informatics Lipics, pp. 61 - 623, http://dx.doi.org/10.4230/LIPIcs.CONCUR.2020.6

Van Glabbeek R; Gramoli V; Tholoniat P, 2020, 'Feasibility of Cross-Chain Payment with Success Guarantees', in Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 579 - 581, http://dx.doi.org/10.1145/3350755.3400264

Back to profile page