Rob van Glabbeek

Principal Researcher at NICTA (Kensington Research Laboratory, Sydney, Australia).
Conjoint Professor at the School of Computer Science & Engineering , The University of New South Wales, Sydney 2052, Australia.
Research Affiliate, Concurrency Group, Theory Division, Computer Science Department, Stanford University.

Email (forever): rvg@cs.stanford.edu
Address:: National ICT Australia
Locked Bag 6016
The University of New South Wales
Sydney, NSW 1466
Australia
Office:: Room 522, Level 5, NICTA, 223 Anzac Parade, Kensington, Sydney, NSW 2052, Australia
Fax: +61.2.8306 0405
Telephone: +61.2.8306 0492
Home address

Main Research Interest: Comparative Concurrency Semantics. Mathematical models and formal languages for the representation of distributed systems and the verification of statements about them; in particular foundational work investigating the possibilities of such models and languages.

A biography of me can be found on my website at NICTA.

Brief CV.
The third millennium started on January 1 of the year 2001.

Research

Publications.

References in bibtex format, dvi, postscript and pdf (employing the vGstyle). [Last updated 2004]
Abstracts

HTTP directory with papers on foundations of concurrency by the Stanford Concurrency Group.

Ph.D. Thesis. (Introduction and table of contents; list of main results).

Research by topic:

Linear Logic [50, 57] (2002-present)
Process algebra (1984-present)
- CCS and CSP [1] (1986)
- ACP, abstraction, fairness, recursion, induction and termination [2,3,4,5] (1984-1987)
- Structural operational semantics (1993 ->)
  - Theory of SOS [28,31,32,33,44,48,51,53,58,61,62,64]
  - SOS for ST-bisimulation [29]
- Expressiveness [31] (1994 ->)
- (In)axiomatizability (1986 ->)
  - Ground-complete axiomatisations [1, 3, 4, 5, 6, 11, 23, 25, 29, 36, 37, 38, 40, 43, 54, 69, 71, 75]
  - Inaxiomatizability results [54, 75]
  - Completeness for open terms [43, 75]
- Iteration [36,37,38] (1995-1997)
- Scheduling algebra [40] (1996-1998) with java applet
- Timeouts [60] (1986, 2005)
Temporal logic (2007)
Semantic equivalences (1984-present)
- The linear time - branching time spectrum [17, 19, 28, 43, 44, 48, 54]
- ... with silent steps [1, i, 26, 75]
- Bisimulation [3, branching, 13, 18, 30, 45, 58, 62, 65]
- Liveness, Fairness & Impossible futures [66, 75]
- Interleaving vs. true concurrency [6, 10, 14, 15, 17, 21, 34, 35, 41, 56, 63]
- ST-bisimulation [6, 15, 17, 29, 34, 35, 56, 63]
Algorithms (for checking the simulation preorder) (2008)
Models of concurrency (1987-present)
- Petri nets [6, 16, 34, 42, 47, 49, 55, 56, 59, 60, 63] (1987 ->)
- Process graphs [8a, 43, 45, iii, 56, 63, 65] (1988 ->)
- Higher dimensional automata [ii, 42, 56, 59, 63] (1991 ->)
- Configuration structures [16,17, 34, 41, 42, 56, 63] (1989 ->)
- Event structures [10, 15,16,17, 20,21, 34, 35, 41, 42, 46, 52, 55, 56, 63] (1987 ->)
- Metric spaces and non-well-founded sets [13] (1989)
Action refinement [10,12,14,15,16,17,20,21,24,29,35,41,46] (1987-2002)
Workflow modeling [47, 49] (2000-2003)
Branching bisimulation [11,12,17,23,25,26,27,36,37,38,58,64,67,73] (1988-1996; 2005 ->)
Probabilistic processes [18,30 69-71] (1989-1994 ; 2005-present)
Modular specification [7,22] (1987-1990)
Interpolation [9] (1988)
Differential topology [0] (1984)

Teaching

Comparative Concurrency Semantics, COMP4151/3152/9152, Autumn 2003, 2005 & 2007 at the University of New South Wales, and Spring 1988 at the University of Amsterdam.

CS 154, Introduction to Automata and Complexity Theory, Winter 1991, 1996, 2001, and Spring 2002 at Stanford University

CS 352, Foundations of Control Structures, Fall 1990 and Spring 1993, 1995 and 1997 at Stanford University

CS 353, Algebra for computer scientists, Spring 1991 at Stanford University

Useful links

Useless links

-----BEGIN GEEK CODE BLOCK-----
Version 3.12
GCS !d@ s++:-- a? C+ SL P++ L++ E+ W++ N o? K? w-- O? M- V? 
PS+++ PE++ Y+ PGP->+ t+ 5? X? R tv-- b+ DI D- G e++++ h-- r++ z+>++
------END GEEK CODE BLOCK------
-----BEGIN PGP PUBLIC KEY BLOCK-----
Version: PGP 6.5.8

mQGiBDu1fvcRBADIX5B/L3Ak6YOSG+mLGI8lC9szJ+AGatigXwyYyO2ocZec3/Fa
J83qU4ld+UuHa3tg9pX724PMABTIOBDviRhwQLvBimaanaQVAEDGVG7TpRqJq7C3
JZzV7Km3uaJKe8ODrMX1MEE8G4xE3mb4g8qjA3mLvnLqbN33ghzWUHsMNwCg/1DJ
hdzO/nZm7NpVtMopVw9eZXcD/3XXUEmbrCUEgshiesfUfspF4NdsopRQ/su/NSOv
ZIu3v6iOOuEGnw2sbbYp2Xppj5+bb4YVRlPc6Yb6UMwWmmouT1YT2KWwOGh8JPmT
ikiUkkQpZ1pTK2+F8gc5EeOAftbENFTE/SCYvJJK9gIk+pjZeXs2KAxunK/d7uqr
+EUHBAC0vBSqJCe9lkwG+BmRoQThLt24BC4LZSB8Ql6gOLo5UhO4NN6Wg/j/tQbu
zWUfB3G8lflyrlyvzwhi0j/5gkW5LO8HDvthombfp1Dn5Vb05KThqqe9d/q4r/kh
yoUrjQ1p3Ue9kKd4QQXIVhXVfyYLS25OwISuVa3KizzX1pzC77QmUm9iIHZhbiBH
bGFiYmVlayA8cnZnQGNzLnN0YW5mb3JkLmVkdT6JAE4EEBECAA4FAju1fvcECwMB
AgIZAQAKCRA5wCTOal2Ogt4oAKCARrGE4D579CHfc11eZmaxcLcMMQCfftxyZq4x
entfE+etUFHL9HE/LbO5AQ0EO7V/ExAEAOsqqTG4VmYbI/YmOei9/z5RREzH9WY0
3zzs0x95j9biTde11yRep0gU2zEo/46wkmmSMUPOHfkd0bmJt2TpQvc7Y5Frq0EJ
IP47vpzEy4ENhvIJRKr5qAFrOGLVxI39hsGMd2z+pzYvOLn95I7i2rf6rvCkYPXv
TqGlX0/AgbV1AAICBADmfZkLYN/thGrc5pOaEuhLxD2Qd7nPsAyIHI97DN5K3dQR
uJtgB1jl/v8Yxq6laknz/pr5mewCVscmaDPVTe4yCv3QzZK+waISaFBP+i5QIQmU
gCI3JzekFqEHuSuVyZT+b2tAgVoOvcp2FEmf8i54Cmz6PDSDVFDcN+xTUfONPokA
RgQYEQIABgUCO7V/EwAKCRA5wCTOal2OgjhvAKDKUnx7f3YCQPRxSmFFf90k1qD3
bwCfdHGu+0N3mRSgRIOSjjF6izSdwLc=
=e70b
-----END PGP PUBLIC KEY BLOCK-----

Hits since September 17, 1997:

Rob van Glabbeek

rvg@CS.Stanford.EDU