Dr Rob van Glabbeek

Dr Rob van Glabbeek

Adjunct Professor
Engineering
Computer Science and Engineering

Rob van Glabbeek has a strong international reputation in the study of the theory of concurrent computation, having made particular contributions to the conciliation of the interleaving and the true concurrency communities by codeveloping the current view of branching time and causality as orthogonal but interacting dimensions of concurrency. He condensed many divergent views on semantic equivalences into the linear time- branching time spectrum. The resulting publications are required reading in the graduate programs of several universities. Together with Peter Weijland he invented the notion of branching bisimulation, that since has become the prototypical example of a branching time equivalence, and the semantic equivalence used in most verification tools based on equivalence checking. With Ursula Goltz he proposed the notion of action refinement as a useful tool for evaluating semantic equivalences and implementation relations. This gave rise to a wave of publications, including a dozen Ph.D. theses. With Peter Rittgen he initiated the application of process algebraic methods in the formal description and analysis of economic production processes. As consultant for Ricoh innovations he contributed to the practical application of concurrency-theoretic ideas in workflow management. With Dominic Hughes he made a crucial contribution to the proof theory of linear logic by proposing a notion of proof net that had been sought after in vain by linear logicians since the inception of linear logic. Together with Vaughan Pratt he initiated the now widespread use of higher dimensional automata and other geometric models of concurrency. With Gordon Plotkin he integrated various causality respecting models of concurrency, including Petri nets, event structures and propositional theories. By bridging the areas of structural operational semantics and logic programming, he developed a proof method and semantics that applies simultaneously to transition system specifications and logic programs. With Wan Fokkink he used results from unification theory and from modal logic to obtain compositionality results in structural operational semantics. This research gave rise to many congruence formats for semantic equivalences and preorders, which allow one to infer compositionality from purely syntactic properties of language specifications. In 2017 he even contributed a congruence format for recursion. In 2007, in cooperation with Yuxin Deng, Matthew Hennessy, Carroll Morgan and Chenyi Zhang, he characterised the may- and must-testing preorders for processes with probabilistic and nondeterministic choice, thereby solving a problem that was posed in 1992 and had remained open ever since. Together with Bas Ploeger, he showed that the leading algorithm for determining whether a program (abstractly represented as a transition system) correctly simulates another such program, is based on a fixed point theory that is irreparably flawed; and repaired the algorithm in a way that bypasses this fixed point theory. In 2011, together with NICTA colleagues Peter Höfner, Annabelle MvIver, Ansgar Fehnker, Marius Portman and Wee Lum Tan, he developed a new process algebra for wireless mesh networks and used it to obtain the first rigorous formalisation of the specification of the popular Ad-hoc On-demand Distance Vector (AODV) routing protocol. This revealed that under a plausible interpretation of the original specification of AODV, the protocol does admit routing loops; this is in direct contradiction with popular belief, the promises of the AODV specification, and the main paper on AODV (with 26000 citations). The NICTA team also proved loop-freedom of AODV under a subtly different interpretation of the original specification. In cooperation with Tim Bourke, this work was mechanically formalised with the theorem prover Isabelle/HOL. In 2012, together with Ursula Goltz and Jens Schicke-Uffmann, he gave a precise characterisation of the class of concurrent systems, modelled as plain Petri nets, that, without making concessions on branching time behaviour, concurrency or divergence, cannot be implemented in a distributed way using only asynchronous communication. In 2015, jointly with Peter Höfner, he established that fair schedulers, as frequently occur in network routers and operating systems, as well as correct mutual exclusion protocols, cannot be rendered in standard process algebras like CCS, at least not without resorting to fairness assumptions. For this type of application, mild extensions of CCS are called for. Also together with Peter Höfner, he wrote a definitive survey of fairness assumptions for concurrent systems, and introduced justness, an assumption in between progress and weak fairness, that is crucial for proving liveness properties of distributed system. In 2019 he published a research agenda for proving liveness properties that is based on this notion; it calls for a radical adaptation of established theories, including strong bisimilarity. He added reward testing as a new and more powerful mode of testing concurrent systems, besides the classical modes of may, must and should testing. In 2020 he proposed reactive temporal logic, a form of temporal logic better adapted to the study of reactive systems. Amongst others, it allows unambiguous formal specifications of what does and doesn't count as a correct mutual exclusion protocol.


In addition, he has organised workshops on combining compositionality and concurrency, on logic, language and information, on the Unified Modelling Language, on workflow management, web services and business process modelling, on automatic and semi-automatic system verification, on structural operational semantics, and on formal methods for embedded systems.
      He is editor-in-chief of Electronic Proceedings in Theoretical Computer Science, a member of the editorial boards of Information and Computation and Theoretical Computer Science, and has been on several dozen program committees.

Career Summary

Rob van Glabbeek has been active as a research scientist in the field of Formal Methods since 1984, of which five years were spent at CWI in Amsterdam and twelve years at Stanford University. In addition he has had visiting appointments at the Technical University of Munich, GMD in Bonn, INRIA in Sophia Antipolis, the University of Edinburgh, the University of Cambridge, and l’Université de la Méditerranée in Marseilles. He has also been active as a consultant for Ricoh Innovations, California, in the area of workflow modelling. From 2003 to 2016 he worked for NICTA, Sydney, Australia, and from July 2016 until October 2021 he was Chief Research Scientist at Data61, CSIRO in Sydney.

Currently he is a Royal Society Wolfson Fellow at the School of Informatics, University of Edinburgh, Scotland. He also is a Conjoint Professor at the School of Computer Science and Engineering at the University of New South Wales, and a Research Affiliate at the Concurrency Group in the Computer Science Department of Stanford University.

Degrees

Rob van Glabbeek earned his Masters degree in Mathematics (cum laude) from the University of Leiden, and a PhD from the Free University in Amsterdam. His thesis was entitled Comparative concurrency semantics and refinement of actions.

Research Interests

Professor van Glabbeek’s research interests include: models of concurrency, process algebra, mesh network protocols, compositional implementation relations, structural operational semantics, proof nets for linear logic, temporal logic, synchronous versus asynchronous communication in distributed systems, and building a theory of processes with probabilities and nondeterminism. Lately he is particularly interested in formulating and proving liveness properties, saying that a system reaches a desired state.

Collaborations

Professor van Glabbeek maintains close ties with the concurrency group at Stanford University. His work on proof nets and on higher-dimensional automata is to a large extent in cooperation with this group. Van Glabbeek also participates in research activities in process algebra and structural operational semantics that span many European sites, including Eindhoven University of Technology and the Free University in Amsterdam. His work on synchronous versus asynchronous communication is in cooperation with Professor Goltz at the University of Braunschweig.

Publications

  • Book Chapters | 2023
    van Glabbeek R, 2023, 'Just Testing', in , pp. 498 - 519, http://dx.doi.org/10.1007/978-3-031-30829-1_24
    Book Chapters | 2022
    van Glabbeek R, 2022, 'Fair Must Testing for I/O Automata', in A Journey from Process Algebra via Timed Automata to Model Learning: Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday, pp. 559 - 574, http://dx.doi.org/10.1007/978-3-031-15629-8_30
    Book Chapters | 2019
    van Glabbeek R; Goltz U; Lippert C; Mennicke S, 2019, 'Stronger Validity Criteria for Encoding Synchrony', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 182 - 205, http://dx.doi.org/10.1007/978-3-030-31175-9_11
    Book Chapters | 2019
    van Glabbeek R, 2019, 'Reward testing equivalences for processes', in Models, Languages, and Tools for Concurrent and Distributed Programming, pp. 45 - 70, http://dx.doi.org/10.1007/978-3-030-21485-2_5
    Book Chapters | 2019
    van Glabbeek RJ; Groote JF; de Vink EP, 2019, 'A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice: (Extended Abstract)', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 139 - 162, http://dx.doi.org/10.1007/978-3-030-31175-9_9
    Book Chapters | 2017
    van Glabbeek R, 2017, 'A Branching Time Model of CSP', in Lecture Notes in Computer Science, Springer International Publishing, pp. 272 - 293, http://dx.doi.org/10.1007/978-3-319-51046-0_14
    Book Chapters | 2011
    van Glabbeek RJ, 2011, 'Bisimulation', in Padua D (ed.), Encyclopedia of Parallel Computing, edn. XXXVIII, Springer, Heidelberg, pp. 136 - 139, http://dx.doi.org/10.1007/978-0-387-09766-4_149
    Book Chapters | 2010
    van Glabbeek RJ; Plotkin G, 2010, 'On CSP and the Algebraic Theory of Effects', in Wood K; Roscoe AW; Jones CB (ed.), Reflections on the work of C.A.R. Hoare, Springer, New York, pp. 333 - 370, http://dx.doi.org/10.1007/978-1-84882-912-1_15
    Book Chapters | 2005
    van Glabbeek RJ, 2005, 'A characterisation for weak bisimulation congruence', in Middeldorp A (ed.), Processes, terms and cycles: Steps on the road to infinity, Springer Publishing Company, Berlin, pp. 26 - 39
    Book Chapters | 2001
    Glabbeek RJV, 2001, 'The Linear Time - Branching Time Spectrum I.**This is an extension of [20]. The research reported in this paper has been initiated at CWI in Amsterdam, continued at the Technical University of Munich, and finalized at Stanford University. It has been supported by Sonderforschungsbereich 342 of the TU München and by ONR under grant number N00014-92-J-1974. Part of it was carried out in the preparation of a course Comparative Concurrency Semantics, given at the University of Amsterdam, Spring 1988. A coloured version of this paper is available at http://boole.stanford.edu/pub/spectruml.ps.gz. The Semantics of Concrete, Sequential Processes', in Handbook of Process Algebra, Elsevier, pp. 3 - 99, http://dx.doi.org/10.1016/b978-044482830-9/50019-9
    Book Chapters | 1995
    van Glabbeek R, 1995, 'On the Expressiveness of ACP', in Workshops in Computing, Springer London, pp. 188 - 217, http://dx.doi.org/10.1007/978-1-4471-2120-6_8
    Book Chapters | 1994
    van Glabbeek R, 1994, 'Full Abstraction in Structural Operational Semantics (extended abstract)', in Workshops in Computing, Springer London, pp. 75 - 82, http://dx.doi.org/10.1007/978-1-4471-3227-1_7
    Book Chapters | 1992
    Czaja I; Glabbeek RJ; Goltz U, 1992, 'Interleaving semantics and action refinement with atomic choice', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 89 - 107, http://dx.doi.org/10.1007/3-540-55610-9_169
  • Journal articles | 2024
    Qin X; O'Connor L; Van Glabbeek R; Höfner P; Kammar O; Steuwer M, 2024, 'Shoggoth: A Formal Foundation for Strategic Rewriting', Proceedings of the ACM on Programming Languages, 8, pp. 61 - 89, http://dx.doi.org/10.1145/3633211
    Journal articles | 2023
    Van Glabbeek R, 2023, 'Comparing the Expressiveness of the π-calculus and CCS', ACM Transactions on Computational Logic, 25, http://dx.doi.org/10.1145/3611013
    Journal articles | 2023
    van Glabbeek R; Gramoli V; Tholoniat P, 2023, 'Cross-chain payment protocols with success guarantees', Distributed Computing, 36, pp. 137 - 157, http://dx.doi.org/10.1007/s00446-023-00446-0
    Journal articles | 2023
    van Glabbeek R, 2023, 'Modelling mutual exclusion in a process algebra with time-outs', Information and Computation, 294, http://dx.doi.org/10.1016/j.ic.2023.105079
    Journal articles | 2023
    van Glabbeek R, 2023, 'Reactive bisimulation semantics for a process algebra with timeouts', Acta Informatica, 60, pp. 11 - 57, http://dx.doi.org/10.1007/s00236-022-00417-1
    Journal articles | 2022
    van Glabbeek R; Goltz U; Schicke-Uffmann JW, 2022, 'Abstract processes in the absence of conflicts in general place/transition systems', Information and Computation, 289, http://dx.doi.org/10.1016/j.ic.2022.104939
    Journal articles | 2021
    van Glabbeek R; Goltz U; Schicke-Uffmann JW, 2021, 'Abstract processes and conflicts in place/transition systems', Information and Computation, 281, http://dx.doi.org/10.1016/j.ic.2021.104706
    Journal articles | 2021
    van Glabbeek R, 2021, 'Failure trace semantics for a process algebra with time-outs', Logical Methods in Computer Science, 17, http://dx.doi.org/10.23638/LMCS-17(2:11)2021
    Journal articles | 2020
    VAN GLABBEEK R; Luttik B; Spaninks L, 2020, 'Rooted divergence-preserving branching bisimilarity is a congruence', Logical Methods in Computer Science, 16, pp. 1 - 14, http://dx.doi.org/10.23638/LMCS-16(3:14)2020
    Journal articles | 2019
    Fokkink W; van Glabbeek R; Luttik B, 2019, 'Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence', Information and Computation, 268, http://dx.doi.org/10.1016/j.ic.2019.104435
    Journal articles | 2019
    Van Glabbeek R; Höfner P, 2019, 'Progress, justness, and fairness', ACM Computing Surveys, 52, http://dx.doi.org/10.1145/3329125
    Journal articles | 2019
    van Glabbeek RJ, 2019, 'Ensuring liveness properties of distributed systems: Open problems', Journal of Logical and Algebraic Methods in Programming, 109, http://dx.doi.org/10.1016/j.jlamp.2019.100480
    Journal articles | 2018
    van Glabbeek RJ, 2018, 'On the validity of encodings of the synchronous in the asynchronous π-calculus', Information Processing Letters, 137, pp. 17 - 25, http://dx.doi.org/10.1016/j.ipl.2018.04.015
    Journal articles | 2017
    Fokkink W; van Glabbeek R, 2017, 'Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity', Information and Computation, 257, pp. 79 - 113, http://dx.doi.org/10.1016/j.ic.2017.10.003
    Journal articles | 2016
    Bourke T; van Glabbeek RJ; Höfner P, 2016, 'Mechanizing a Process Algebra for Network Protocols', Journal of Automated Reasoning, 56, pp. 309 - 341, http://dx.doi.org/10.1007/s10817-015-9358-9
    Journal articles | 2016
    van Glabbeek R; Höfner P; Portmann M; Tan WL, 2016, 'Modelling and verifying the AODV routing protocol', Distributed Computing, 29, pp. 279 - 315, http://dx.doi.org/10.1007/s00446-015-0262-7
    Journal articles | 2015
    Chen T; Fokkink W; Van Glabbeek R, 2015, 'On the axiomatizability of impossible futures', Logical Methods in Computer Science, 11, http://dx.doi.org/10.2168/LMCS-11(3:17)2015
    Journal articles | 2015
    van Glabbeek R; Groote JF; Höfner P, 2015, 'Proceedings Workshop on Models for Formal Analysis of Real Systems', Electronic Proceedings in Theoretical Computer Science, 196, http://dx.doi.org/10.4204/eptcs.196.0
    Journal articles | 2015
    van Glabbeek RJ; Goltz U; Olderog E-R, 2015, 'Special issue on “Combining Compositionality and Concurrency”: part 2', Acta Informatica, http://dx.doi.org/10.1007/s00236-015-0240-3
    Journal articles | 2015
    van Glabbeek RJ; Goltz U; Olderog ER, 2015, 'Special issue on “Combining Compositionality and Concurrency”: part 1', Acta Informatica, 52, pp. 3 - 4, http://dx.doi.org/10.1007/s00236-014-0213-y
    Journal articles | 2015
    van Glabbeek RJ; Höfner P, 2015, 'CCS: It’s not fair!: Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions', Acta Informatica, 52, pp. 175 - 205, http://dx.doi.org/10.1007/s00236-015-0221-6
    Journal articles | 2014
    Deng Y; van Glabbeek R; Hennessy M; Morgan C, 2014, 'Real-reward testing for probabilistic processes', Theoretical Computer Science, 538, pp. 16 - 36, http://dx.doi.org/10.1016/j.tcs.2013.07.016
    Journal articles | 2013
    van Glabbeek R; Goltz U; Schicke-Uffmann JW, 2013, 'On characterising distributability', Logical Methods in Computer Science, 9, http://dx.doi.org/10.2168/LMCS-9(3:17)2013
    Journal articles | 2012
    Fokkink W; van Glabbeek RJ; de Wind P, 2012, 'Divide and Congruence: From Decomposition of Modal Formulas to Preservation of Branching and η-Bisimilarity', Information and Computation, 214, pp. 59 - 85, http://dx.doi.org/10.1016/j.ic.2011.10.011
    Journal articles | 2012
    Hoefner P; van Glabbeek RJ; Hayes I, 2012, 'Preface - Morgan: a suitable case for treatment', Formal Aspects of Computing, 24, pp. 417 - 422, http://dx.doi.org/10.1007/s00165-012-0257-0
    Journal articles | 2011
    van Glabbeek RJ; Goltz U; Schicke J, 2011, 'Abstract processes of place/transition systems', Information Processing Letters, 111, pp. 626 - 633, http://dx.doi.org/10.1016/j.ipl.2011.03.013
    Journal articles | 2011
    van Glabbeek RJ, 2011, 'On cool congruence formats for weak bisimulations', Theoretical Computer Science, 412, pp. 3283 - 3302, http://dx.doi.org/10.1016/j.tcs.2011.02.036
    Journal articles | 2009
    van Glabbeek RJ; Goltz U; Schicke J, 2009, 'Symmetric and Asymmetric Asynchronous Interaction', Electronic Notes in Theoretical Computer Science, 229, pp. 77 - 95, http://dx.doi.org/10.1016/j.entcs.2009.06.040
    Journal articles | 2009
    van Glabbeek RJ; Luttik B; Trka N, 2009, 'Branching bisimilarity with explicit divergence', Fundamenta Informaticae, 93, pp. 371 - 392
    Journal articles | 2009
    van Glabbeek RJ; Luttik B; Trka N, 2009, 'Computation Tree Logic with Deadlock Detection', Logical Methods in Computer Science, 5, pp. 1 - 21, http://dx.doi.org/10.2168/LMCS-5(4:5)2009
    Journal articles | 2009
    van Glabbeek RJ; Mosses P, 2009, 'Special issue on structural operational semantics: Preface', Information and Computation, 207, pp. 83 - 84, http://dx.doi.org/10.1016/j.ic.2008.10.006
    Journal articles | 2009
    van Glabbeek RJ; Plotkin G, 2009, 'Configuration structures, event structures and Petri nets', Theoretical Computer Science, 410, pp. 4111 - 4159, http://dx.doi.org/10.1016/j.tcs.2009.06.014
    Journal articles | 2008
    Deng Y; van Glabbeek RJ; Hennessy M; Morgan CC, 2008, 'Characterising Testing Preorders for Finite Probabilistic Processes', Logical Methods in Computer Science, 4, http://dx.doi.org/10.2168/LMCS-4(4:4)2008
    Journal articles | 2008
    Fokkink W; van Glabbeek RJ, 2008, 'Ready to preorder: The case of weak process semantics', Information Processing Letters, 109, pp. 104 - 111
    Journal articles | 2007
    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
    Journal articles | 2007
    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
    Journal articles | 2007
    van Glabbeek RJ; Hennessy M, 2007, 'Preface', Electronic Notes in Theoretical Computer Science, 192
    Journal articles | 2007
    van Glabbeek RJ, 2007, 'Preface', Electronic Notes in Theoretical Computer Science, 75
    Journal articles | 2006
    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
    Journal articles | 2006
    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
    Journal articles | 2006
    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
    Journal articles | 2006
    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
    Journal articles | 2006
    van Glabbeek RJ, 2006, 'On the expressiveness of higher dimensional automata (vol 356, pg 265, 2006)', Theoretical Computer Science, 368, pp. 168 - 194
    Journal articles | 2006
    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
    Journal articles | 2005
    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
    Journal articles | 2005
    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
    Journal articles | 2004
    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
    Journal articles | 2004
    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
    Journal articles | 2004
    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
    Journal articles | 2004
    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
    Journal articles | 2004
    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
    Journal articles | 2003
    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
    Journal articles | 2003
    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
    Journal articles | 2003
    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
    Journal articles | 2003
    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
    Journal articles | 2003
    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
    Journal articles | 2002
    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
    Journal articles | 2001
    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
    Journal articles | 2000
    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
    Journal articles | 2000
    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
    Journal articles | 1999
    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
    Journal articles | 1997
    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
    Journal articles | 1997
    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
    Journal articles | 1996
    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
    Journal articles | 1996
    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
    Journal articles | 1996
    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
    Journal articles | 1995
    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
    Journal articles | 1995
    van Glabbeek RJ; Plotkin GD, 1995, 'Configuration structures (extended abstract)', Proceedings - Symposium on Logic in Computer Science, pp. 199 - 209
    Journal articles | 1993
    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
    Journal articles | 1990
    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
    Journal articles | 1989
    Baeten JCM; Van Glabbeek RJ, 1989, 'Abstraction and Empty Process in Process Algebra1', Fundamenta Informaticae, 12, pp. 221 - 241, http://dx.doi.org/10.3233/fi-1989-12208
  • Conference Papers | 2024
    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
    Conference Papers | 2023
    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
    Conference Papers | 2023
    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
    Preprints | 2023
    van Glabbeek R; Höfner P; Wang W, 2023, A Lean-Congruence Format for EP-Bisimilarity, , http://dx.doi.org/10.48550/arxiv.2309.07933
    Preprints | 2022
    van Glabbeek R; Goltz U; Schicke-Uffmann J-W, 2022, Abstract Processes in the Absence of Conflicts in General Place/Transition Systems, , http://dx.doi.org/10.48550/arxiv.2207.04362
    Conference Papers | 2022
    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
    Conference Papers | 2021
    Glabbeek RV; Hofner P; Horne R, 2021, 'Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom', in 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), IEEE, pp. 1 - 13, presented at 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 29 June 2021 - 02 July 2021, http://dx.doi.org/10.1109/lics52264.2021.9470531
    Preprints | 2021
    van Glabbeek R; Goltz U; Schicke J-W, 2021, On Causal Semantics of Petri Nets, , http://dx.doi.org/10.48550/arxiv.2103.00729
    Preprints | 2021
    van Glabbeek R; Goltz U; Schicke-Uffmann J-W, 2021, Abstract Processes and Conflicts in Place/Transition Systems, , http://dx.doi.org/10.48550/arxiv.2103.01490
    Preprints | 2021
    van Glabbeek R; Höfner P; Horne R, 2021, Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom, , http://dx.doi.org/10.48550/arxiv.2104.14226
    Preprints | 2021
    van Glabbeek R; Höfner P; Wang W, 2021, Enabling Preserving Bisimulation Equivalence, , http://dx.doi.org/10.48550/arxiv.2108.00142
    Conference Papers | 2020
    Barry R; van Glabbeek R; Höfner P, 2020, 'Formalising the optimised link state routing protocol', in Electronic Proceedings in Theoretical Computer Science, EPTCS, pp. 40 - 71, http://dx.doi.org/10.4204/EPTCS.316.3
    Preprints | 2020
    Barry R; van Glabbeek R; Höfner P, 2020, Formalising the Optimised Link State Routing Protocol, , http://dx.doi.org/10.48550/arxiv.2004.13285
    Conference Papers | 2020
    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
    Preprints | 2020
    van Glabbeek R; Gramoli V; Tholoniat P, 2020, Feasibility of Cross-Chain Payment with Success Guarantees, , http://dx.doi.org/10.48550/arxiv.2007.08152
    Conference Papers | 2020
    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
    Conference Papers | 2020
    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
    Preprints | 2020
    van Glabbeek R, 2020, Reactive Temporal Logic, , http://dx.doi.org/10.48550/arxiv.2008.13357
    Conference Abstracts | 2019
    Fischer N; van Glabbeek R, 2019, 'Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours', in Journal of Logical and Algebraic Methods in Programming, Vol. 102, pp. 64 - 102, http://dx.doi.org/10.1016/j.jlamp.2018.09.006
    Preprints | 2019
    Fokkink W; van Glabbeek R; Luttik B, 2019, Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence, , http://dx.doi.org/10.48550/arxiv.1908.06550
    Conference Papers | 2019
    Fokkink W; van Glabbeek R, 2019, 'Preface', in Leibniz International Proceedings in Informatics, LIPIcs
    Preprints | 2019
    van Glabbeek R; Gramoli V; Tholoniat P, 2019, Cross-Chain Payment Protocols with Success Guarantees, , http://dx.doi.org/10.48550/arxiv.1912.04513
    Conference Papers | 2019
    van Glabbeek R; Höfner P; Markl M, 2019, 'A Process Algebra for Link Layer Protocols', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Prague, Czech Republic, pp. 668 - 693, presented at 28th European Symposium on Programming, ESOP 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, proceedings, Prague, Czech Republic, 06 April 2019 - 11 April 2019, http://dx.doi.org/10.1007/978-3-030-17184-1_24
    Preprints | 2019
    van Glabbeek R; Höfner P; Markl M, 2019, A Process Algebra for Link Layer Protocols, , http://dx.doi.org/10.48550/arxiv.1907.13329
    Conference Papers | 2019
    van Glabbeek R, 2019, 'Justness: A Completeness Criterion for Capturing Liveness Properties (Extended Abstract)', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Prague, Czech Republic, pp. 505 - 522, presented at 22nd International Conference, FOSSACS 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, proceedings, Prague, Czech Republic, 06 April 2019 - 11 April 2019, http://dx.doi.org/10.1007/978-3-030-17127-8_29
    Conference Papers | 2019
    van Glabbeek R, 2019, 'On the meaning of transition system specifications', in Electronic Proceedings in Theoretical Computer Science, EPTCS, Amsterdam, The Netherlands, pp. 69 - 85, presented at EXPRESS/SOS, Amsterdam, The Netherlands, 26 August 2019, http://dx.doi.org/10.4204/EPTCS.300.5
    Preprints | 2019
    van Glabbeek R, 2019, On the Meaning of Transition System Specifications, , http://dx.doi.org/10.48550/arxiv.1908.08635
    Conference Papers | 2018
    Gallagher JP; Van Glabbeek R; Serwe W, 2018, 'Preface', in Electronic Proceedings in Theoretical Computer Science, EPTCS, http://dx.doi.org/10.4204/EPTCS.268
    Conference Papers | 2018
    van Glabbeek R; Höfner P; van der Wal D, 2018, 'Analysing AWN-specifications using mCRL2 (extended abstract)', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Maynooth, Ireland, pp. 398 - 418, presented at International Conference on Integrated Formal Methods, Maynooth, Ireland, 05 September 2018 - 07 September 2018, http://dx.doi.org/10.1007/978-3-319-98938-9_23
    Preprints | 2018
    van Glabbeek R; Höfner P, 2018, Progress, Justness and Fairness, , http://dx.doi.org/10.48550/arxiv.1810.07414
    Preprints | 2018
    van Glabbeek R; Luttik B; Spaninks L, 2018, Rooted Divergence-Preserving Branching Bisimilarity is a Congruence, , http://dx.doi.org/10.48550/arxiv.1801.01180
    Conference Papers | 2018
    van Glabbeek R, 2018, 'A theory of encodings and expressiveness', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 183 - 202, http://dx.doi.org/10.1007/978-3-319-89366-2_10
    Conference Papers | 2017
    Dyseryn V; Van Glabbeek R; Höfner P; Hofner P, 2017, 'Analysing mutual exclusion using process algebra with signals', in Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, Berlin; Germany, pp. 18 - 34, presented at 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics, Berlin; Germany, 31 August 2017 - 04 September 2017, http://dx.doi.org/10.4204/EPTCS.255.2
    Preprints | 2017
    Dyseryn V; van Glabbeek R; Höfner P, 2017, Analysing Mutual Exclusion using Process Algebra with Signals, , http://dx.doi.org/10.48550/arxiv.1709.00826
    Conference Papers | 2017
    Fokkink W; Van Glabbeek RJ, 2017, 'Precongruence formats with lookahead through modal decomposition', in Leibniz International Proceedings in Informatics, LIPIcs, Stockholm University, Sweden, presented at 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), Stockholm University, Sweden, 20 August 2017 - 24 August 2017, http://dx.doi.org/10.4230/LIPIcs.CSL.2017.25
    Conference Papers | 2017
    Van Glabbeek R; Höfner P; Hofner P, 2017, 'Split, send, reassemble: A formal specification of a CAN bus protocol stack', in Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, Uppsala, Sweden, pp. 14 - 52, presented at 2nd Workshop on Models for Formal Analysis of Real Systems, Uppsala, Sweden, 29 April 2017 - 29 April 2017, http://dx.doi.org/10.4204/EPTCS.244.2
    Conference Papers | 2017
    Van Glabbeek R, 2017, 'Lean and full congruence formats for recursion', in Proceedings - Symposium on Logic in Computer Science, Reykjavik, Iceland, presented at 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 20 June 2017 - 23 June 2017, http://dx.doi.org/10.1109/LICS.2017.8005142
    Preprints | 2017
    van Glabbeek R; Höfner P, 2017, Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack, , http://dx.doi.org/10.48550/arxiv.1703.06569
    Conference Papers | 2016
    Bres E; Van Glabbeek R; Höfner P, 2016, 'A timed process algebra for wireless networks with an application in routing', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Eindhoven, pp. 95 - 122, presented at 25th European Symposium on Programming (ESOP), Eindhoven, 03 April 2016 - 08 August 2016, http://dx.doi.org/10.1007/978-3-662-49498-1_5
    Preprints | 2016
    Bres E; van Glabbeek R; Höfner P, 2016, A Timed Process Algebra for Wireless Networks, , http://dx.doi.org/10.48550/arxiv.1606.03663
    Conference Papers | 2016
    Fokkink W; Van Glabbeek R, 2016, 'Divide and Congruence II: Delay and Weak Bisimilarity', in Proceedings - Symposium on Logic in Computer Science, pp. 778 - 787, http://dx.doi.org/10.1145/2933575.2933590
    Preprints | 2016
    Fokkink W; van Glabbeek R, 2016, Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity, , http://dx.doi.org/10.48550/arxiv.1604.07530
    Preprints | 2015
    Chen T; Fokkink W; van Glabbeek R, 2015, On the Axiomatizability of Impossible Futures, , http://dx.doi.org/10.48550/arxiv.1505.04985
    Preprints | 2015
    Fehnker A; van Glabbeek R; Höfner P; McIver A; Portmann M; Tan WL, 2015, A Process Algebra for Wireless Mesh Networks, , http://dx.doi.org/10.48550/arxiv.1512.07319
    Preprints | 2015
    Fehnker A; van Glabbeek R; Höfner P; McIver A; Portmann M; Tan WL, 2015, Automated Analysis of AODV using UPPAAL, , http://dx.doi.org/10.48550/arxiv.1512.07352
    Preprints | 2015
    Fehnker A; van Glabbeek R; Höfner P; McIver A; Portmann M; Tan WL, 2015, Modelling and Analysis of AODV in UPPAAL, , http://dx.doi.org/10.48550/arxiv.1512.07312
    Preprints | 2015
    Höfner P; van Glabbeek R; Tan WL; Portmann M; McIver A; Fehnker A, 2015, A Rigorous Analysis of AODV and its Variants, , http://dx.doi.org/10.48550/arxiv.1512.08873
    Conference Papers | 2015
    Peters K; Van Glabbeek R, 2015, 'Analysing and comparing encodability criteria', in Electronic Proceedings in Theoretical Computer Science, EPTCS, pp. 46 - 60, http://dx.doi.org/10.4204/EPTCS.190.4
    Conference Papers | 2015
    Van Glabbeek R; Groote JF; Höfner P, 2015, 'Preface', in Electronic Proceedings in Theoretical Computer Science, EPTCS, http://dx.doi.org/10.4204/EPTCS.196
    Conference Papers | 2015
    Van Glabbeek RJ, 2015, 'Structure preserving bisimilarity, supporting an operational petri net semantics of CCSP', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 99 - 130, http://dx.doi.org/10.1007/978-3-319-23506-6_9
    Preprints | 2015
    van Glabbeek R; Groote JF; Höfner P, 2015, Proceedings Workshop on Models for Formal Analysis of Real Systems,
    Preprints | 2015
    van Glabbeek R; Höfner P; Portmann M; Tan WL, 2015, Modelling and Verifying the AODV Routing Protocol, , http://dx.doi.org/10.48550/arxiv.1512.08867
    Preprints | 2015
    van Glabbeek R; Höfner P; Tan WL; Portmann M, 2015, Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops, , http://dx.doi.org/10.48550/arxiv.1512.08891
    Preprints | 2015
    van Glabbeek R; Höfner P, 2015, CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, , http://dx.doi.org/10.48550/arxiv.1505.05964
    Preprints | 2015
    van Glabbeek R; Höfner P, 2015, Progress, Fairness and Justness in Process Algebra, , http://dx.doi.org/10.48550/arxiv.1501.03268
    Conference Papers | 2014
    Bourke T; Van Glabbeek RJ; Höfner P, 2014, 'Showing invariance compositionally for a process algebra for network protocols', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 144 - 159, http://dx.doi.org/10.1007/978-3-319-08970-6_10
    Conference Papers | 2014
    Bourke T; van Glabbeek R; Höfner P, 2014, 'A mechanized proof of loop freedom of the (untimed) AODV routing protocol', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, pp. 47 - 63, presented at Automated Technology for Verification and Analysis, Sydney, 03 November 2014 - 06 November 2014, http://dx.doi.org/10.1007/978-3-319-11936-6_5
    Preprints | 2013
    Fehnker A; van Glabbeek R; Höfner P; McIver A; Portmann M; Tan WL, 2013, A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV, , http://dx.doi.org/10.48550/arxiv.1312.7645
    Reports | 2013
    Fehnker A; van Glabbeek RJ; Höfner P; McIver AK; Portmann M; Tan WL, 2013, A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV, NICTA, Sydney, 5513, http://nicta.com.au/
    Conference Papers | 2013
    Van Glabbeek R; Höfner P; Tan WL; Portmann M, 2013, 'Sequence numbers do not guarantee loop freedom - AODV can yield routing loops', in MSWiM 2013 - Proceedings of the 16th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 91 - 100, http://dx.doi.org/10.1145/2507924.2507943
    Preprints | 2013
    van Glabbeek RJ; Goltz U; Schicke-Uffmann J-W, 2013, On Characterising Distributability, , http://dx.doi.org/10.48550/arxiv.1309.3883
    Conference Papers | 2012
    Fehnker A; van Glabbeek RJ; Hoefner P; McIver A; Portmann M; Tan WL, 2012, 'A process algebra for wireless mesh networks', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) v. 7211, Springer, Tallinn, Estonia, pp. 295 - 315, presented at 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, 24 March 2012 - 01 April 2012, http://dx.doi.org/10.1007/978-3-642-28869-2_15
    Conference Papers | 2012
    Fehnker A; van Glabbeek RJ; Hoefner P; McIver A; Portmann M; Tan WL, 2012, 'Automated analysis of AODV using UPPAAL', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) v. 7214, Springer, Tallinn, Estonia, pp. 173 - 187, presented at 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2012, Tallinn, Estonia, 24 March 2012 - 01 April 2012, http://dx.doi.org/10.1007/978-3-642-28756-5_13
    Conference Papers | 2012
    Höfner P; van Glabbeek RJ; Tan WL; Portman M; McIver A; Fehnker A, 2012, 'A Rigorous Analysis of AODV and its Variants', in MSWIM'12, ACM, New York, NY, USA ©2012, pp. 203 - 212, presented at 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM 2012), Paphos, Cyprus, 21 October 2012 - 25 October 2012, http://dx.doi.org/10.1145/2387238.2387274
    Preprints | 2012
    van Glabbeek R; Goltz U; Schicke-Uffmann J-W, 2012, On Distributability of Petri Nets, , http://dx.doi.org/10.48550/arxiv.1207.3597
    Conference Papers | 2012
    van Glabbeek RJ; Goltz U; Schicke-Uffmann JW, 2012, 'On distributability of petri nets', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) v. 7213, Springer, Tallinn, Estonia, pp. 331 - 345, presented at 15th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, 24 March 2012 - 01 April 2012, http://dx.doi.org/10.1007/978-3-642-28729-9_22
    Conference Papers | 2012
    van Glabbeek RJ, 2012, 'Musings on Encodings and Expressiveness', in Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, Open Publishing Association, Sydney, Australia, pp. 81 - 98, presented at Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, Newcastle upon Tyne, UK, 03 September 2012, http://dx.doi.org/10.4204/EPTCS.89.7
    Preprints | 2011
    Deng Y; van Glabbeek R; Hennessy M; Morgan C, 2011, Real-Reward Testing for Probabilistic Processes (Extended Abstract), http://dx.doi.org/10.48550/arxiv.1107.1201
    Conference Papers | 2011
    Deng Y; van Glabbeek RJ; Hennessy M; Morgan CC, 2011, 'Real-Reward Testing for Probabilistic Processes (extended abstract)', in Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, Open Publishing Association, Sydney, Australia, pp. 61 - 73, presented at Ninth Workshop on Quantitative Aspects of Programming Languages, Saarbrücken, Germany, http://dx.doi.org/10.4204/EPTCS.57.5
    Conference Papers | 2011
    Fehnker A; van Glabbeek RJ; Hoefner P; Mciver AK; Portmann M; Tan WL, 2011, 'Modelling and Analysis of AODV in UPPAAL', in Proceedings 1st International Workshop on Rigorous Protocol Engineering, WRiPE 2011, Philadelphia, PA, USA, pp. 1 - 6, presented at Proceedings 1st International Workshop on Rigorous Protocol Engineering (WRiPE 2011), Vancouver, Canada, 17 October 2011, http://wripe11.cis.upenn.edu/program/papers/wripe11-paper10.pdf
    Preprints | 2011
    van Glabbeek R; Goltz U; Schicke J-W, 2011, Abstract Processes of Place/Transition Systems, , http://dx.doi.org/10.48550/arxiv.1103.5916
    Conference Papers | 2011
    van Glabbeek RJ; Goltz U; Schicke J-W, 2011, 'On Causal Semantics of Petri Nets (Extended Abstract)', in Katoen JP; Konig B (ed.), CONCUR 2011: CONCURRENCY THEORY, SPRINGER-VERLAG BERLIN, GERMANY, Aachen, pp. 43 - +, presented at 22nd Conference on Concurrency Theory (CONCUR 2011), GERMANY, Aachen, 06 September 2011 - 09 September 2011, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000307082500004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1
    Conference Papers | 2011
    van Glabbeek RJ; Goltz U; Schicke J, 2011, 'On causal semantics of Petri nets', in Katoen JP; König B (ed.), CONCUR 2011 - Concurrency Theory, Springer-Verlag, Berlin, pp. 43 - 59, presented at 22nd Conference on Concurrency Theory, CONCUR 2011, Aachen, Germany, 06 September 2011 - 09 September 2011, http://dx.doi.org/10.1007/978-3-642-23217-6_4
    Reports | 2010
    van Glabbeek RJ; Deng Y, 2010, Characterising Probabilistic Processes Logically, arXiv:1007.5188, http://arxiv.org/abs/1007.5188
    Conference Papers | 2010
    van Glabbeek RJ, 2010, 'The Coarsest Precongruences Respecting Safety and Liveness Properties', in Calude CS; Sassone V (ed.), Proceedings 6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010, Springer, Berlin, pp. 32 - 52, presented at Theoretical Computer Science, Brisbane, Australia, 20 September 2010 - 23 September 2010
    Conference Papers | 2009
    Chen TP; Fokkink W; van Glabbeek RJ, 2009, 'On finite bases for weak semantics:Failures versus impossible futures', in 12th European Conference, JELIA 2010 Helsinki, Finland, September 13-15, 2010 Proceedings, Springer, Berlin, Germany, presented at 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic
    Conference Papers | 2009
    Deng Y; Hennessy M; van Glabbeek RJ; Morgan CC, 2009, 'Testing Finitary Probabilistic Processes', in Proceedings of the First International Conference on Advances in Natural Computation (ICNC 2005), Part III, Lecture Notes in Computer Science 3612/2005, Springer, Berlin, Germany, presented at 20th International Conference on Concurrency Theory, Bologna, Italy, http://dx.doi.org/10.1007/978-3-642-04081-8_19
    Preprints | 2009
    van Glabbeek R; Luttik B; Trcka N, 2009, Computation Tree Logic with Deadlock Detection, , http://dx.doi.org/10.48550/arxiv.0912.2109
    Preprints | 2008
    Chen T; Fokkink W; van Glabbeek R, 2008, On Finite Bases for Weak Semantics: Failures versus Impossible Futures, , http://dx.doi.org/10.48550/arxiv.0810.4904
    Conference Papers | 2008
    Van Glabbeek R; Goltz U; Schicke JW, 2008, 'On synchronous and asynchronous interaction in distributed systems', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 16 - 35, http://dx.doi.org/10.1007/978-3-540-85238-4_2
    Conference Papers | 2008
    Van Glabbeek R; Ploeger B, 2008, 'Five determinisation algorithms', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 161 - 170, http://dx.doi.org/10.1007/978-3-540-70844-5_17
    Preprints | 2008
    van Glabbeek R; Goltz U; Schicke J-W, 2008, On Synchronous and Asynchronous Interaction in Distributed Systems, , http://dx.doi.org/10.48550/arxiv.0901.0048
    Preprints | 2008
    van Glabbeek R; Goltz U; Schicke J-W, 2008, Symmetric and Asymmetric Asynchronous Interaction, , http://dx.doi.org/10.48550/arxiv.0901.0043
    Preprints | 2008
    van Glabbeek R; Luttik B; Trcka N, 2008, Branching Bisimilarity with Explicit Divergence, , http://dx.doi.org/10.48550/arxiv.0812.3068
    Conference Papers | 2008
    van Glabbeek RJ; Deng Y, 2008, 'Characterising Probabilistic Processes Logically (extended abstract)', in Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, Springer, Yogyakarta, Indonesia, presented at 2010 International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 22 November 2008 - 27 November 2008, http://dx.doi.org/10.1007/978-3-642-16242-8_20
    Conference Papers | 2008
    van Glabbeek RJ; Ploeger B, 2008, 'Correcting a Space-Efficient Simulation Algorithm', in Gupta A; Malik S (ed.), Proceedings 20th International Conference on Computer Aided Verification (CAV 2008), Princeton, USA, July 2008, Springer, Berlin, Heidelberg, pp. 517 - 529, presented at 20th International Conference on Computer Aided Verification (CAV 2008, Princeton, USA, 07 July 2008 - 14 July 2008, http://dx.doi.org/10.1007/978-3-540-70545-1_49
    Conference Papers | 2007
    Deng Y; van Glabbeek RJ; Hennessy M; Morgan CC; Zhang C, 2007, 'Characterising testing preorders for finite probabilistic processes', in 22nd Annual IEEE symposium on logic in computer science, Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331, Piscataway, NJ 08855-1331, United States, Wroclaw, Poland, pp. 313 - 322, presented at 22nd Annual IEEE symposium on logic in computer science, Wroclaw, Poland, 10 July 2007 - 14 July 2007, http://dx.doi.org/10.1109/LICS.2007.15
    Conference Papers | 2007
    Deng Y; van Glabbeek RJ; Morgan CC; Zhang C, 2007, 'Scalar outcomes suffice for finitary probabilistic testing', in 16th European symposium on programming, 2007, Braga, Portugal, presented at 16th European symposium on programming, 2007, Braga, Portugal, 24 March 2007 - 01 April 2007
    Conference Papers | 2006
    van Glabbeek RJ; Voorhoeve M, 2006, 'Liveness, fairness and impossible futures', in 17th international conference on Concurrency theory---CONCUR 2006, Bonn, Germany, presented at 17th international conference on Concurrency theory---CONCUR 2006, Bonn, Germany
    Conference Papers | 2005
    Fokkink W; van Glabbeek RJ; de Wind P, 2005, 'Divide and Congruence Applied to n-Bisimulation', in Electronic Notes in Theoretical Computer Science, Elsevier BV, Lisbon, Portugal, presented at 2nd Workshop on Structural Operational Semantics, Lisbon, Portugal, 10 July 2005
    Conference Papers | 2005
    Fokkink W; van Glabbeek RJ; de Wind P, 2005, 'Divide and congruence: From decomposition of modalities to preservation of branching bisimulation', in 4th international symposium on Formal methods for components and objects, Amsterdam, Netherlands, presented at 4th international symposium on Formal methods for components and objects, Amsterdam, Netherlands, 01 November 2005 - 04 November 2005
    Conference Papers | 2005
    van Glabbeek RJ, 2005, 'On cool congruence formats for weak bisimulations', in international colloquium on theoretical aspects of computing, Hanoi, Vietnam, presented at international colloquium on theoretical aspects of computing, Hanoi, Vietnam, 17 October 2005 - 21 October 2005
    Conference Papers | 2005
    van Glabbeek RJ, 2005, 'The individual and collective token interpretations of Petri nets', in 16th international conference on concurrency theory, San Francisco, California USA, presented at 16th international conference on concurrency theory, San Francisco, California USA, 23 August 2005 - 26 August 2005
    Conference Papers | 2004
    van Glabbeek RJ, 2004, 'On the Expressiveness of Higher Dimensional Automata: (Extended Abstract)', in Electronic Notes in Theoretical Computer Science, Elsevier BV, London, England, presented at EXPRESS 2004, London, England, 30 August 2004, http://www.sciencedirect.com/science/article/B75H1-4FW17DG-2/2/dc02332c27dc63ffb00f32b03bcb4efb
    Preprints | 2002
    Bloom B; Fokkink WJ; van Glabbeek RJ, 2002, Precongruence Formats for Decorated Trace Semantics, , http://dx.doi.org/10.48550/arxiv.cs/0204039
    Conference Papers | 1998
    van Glabbeek R; Rittgen P, 1998, 'Scheduling algebra', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 278 - 292, http://dx.doi.org/10.1007/3-540-49253-4_21
    Conference Papers | 1997
    van Glabbeek RJ, 1997, 'Axiomatizing flat iteration', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 228 - 242, http://dx.doi.org/10.1007/3-540-63141-0_16
    Conference Papers | 1996
    van Glabbeek RJ, 1996, 'The meaning of negative premises in transition system specifications II', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 502 - 513, http://dx.doi.org/10.1007/3-540-61440-0_154
    Conference Papers | 1993
    van Glabbeek RJ, 1993, 'A complete axiomatization for branching bisimulation congruence of finite-state behaviours', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 473 - 484, http://dx.doi.org/10.1007/3-540-57182-5_39
    Conference Papers | 1993
    van Glabbeek RJ, 1993, 'The linear time - branching time spectrum II: The semantics of sequential systems with silent moves', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 66 - 81, http://dx.doi.org/10.1007/3-540-57208-2_6
    Conference Papers | 1990
    van Glabbeek R; Goltz U, 1990, 'Refinement of actions in causality based models', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 267 - 300, http://dx.doi.org/10.1007/3-540-52559-9_68
    Conference Papers | 1990
    van Glabbeek RJ; Goltz U, 1990, 'Equivalences and refinement', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 309 - 333, http://dx.doi.org/10.1007/3-540-53479-2_13
    Conference Papers | 1990
    van Glabbeek RJ, 1990, 'The linear time-branching time spectrum', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 278 - 297, http://dx.doi.org/10.1007/BFb0039066
    Conference Papers | 1989
    van Glabbeek R; Goltz U, 1989, 'Equivalence notions for concurrent systems and refinement of actions', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 237 - 248, http://dx.doi.org/10.1007/3-540-51486-4_71
    Conference Papers | 1989
    van Glabbeek R; Vaandrager F, 1989, 'Modular specifications in process Algebra', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 465 - 506, http://dx.doi.org/10.1007/BFb0015049
    Conference Papers | 1987
    Baeten JCM; van Glabbeek RJ, 1987, 'Another look at abstraction in process algebra: Extended abstract', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 84 - 94, http://dx.doi.org/10.1007/3-540-18088-5_8
    Conference Papers | 1987
    Baeten JCM; van Glabbeek RJ, 1987, 'Merge and termination in process algebra', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 153 - 172, http://dx.doi.org/10.1007/3-540-18625-5_49
    Conference Papers | 1987
    van Glabbeek R; Vaandrager F, 1987, 'Petri net models for algebraic theories of concurrency: Extended abstract', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 224 - 242, http://dx.doi.org/10.1007/3-540-17945-3_13
    Conference Papers | 1987
    van Glabbeek RJ, 1987, 'Bounded nondeterminism and the approximation induction principle in process algebra', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 336 - 347, http://dx.doi.org/10.1007/BFb0039617
    Conference Papers |
    Van Glabbeek RJ; Plotkin GD, 'Configuration structures', in Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, IEEE, presented at Tenth Annual IEEE Symposium on Logic in Computer Science, http://dx.doi.org/10.1109/lics.1995.523257

Since 2015 (for life):
Foreign member of the Royal Holland Society of Sciences and Humanities.
2020:
Recipient of the CONCUR test-of-time award.