By Dr Rob van Glabbeek

Book Chapters

van Glabbeek R, 2023, 'Just Testing', in , pp. 498 - 519, http://dx.doi.org/10.1007/978-3-031-30829-1_24

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

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

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

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

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

van Glabbeek RJ, 2011, 'Bisimulation', in Padua D (ed.), Encyclopedia of Parallel Computing, Springer, Heidelberg, pp. 136 - 139, http://dx.doi.org/10.1007/978-0-387-09766-4_149

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

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

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

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

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

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

Back to profile page