Rob van Glabbeek

Visiting research fellow, University of Edinburgh (Scotland).
Research Affiliate, Concurrency Group, Theory Division, Computer Science Department, Stanford University.
Visiting scientist at Ricoh Innovations (Menlo Park, California), CWI (Amsterdam, The Netherlands), NICTA (Sydney, Australia), INRIA (Sophia-Antipolis, France), University of Edinburgh (Scotland), University of Cambridge (England) and possibly several other institutes.

Ph.D.: Free University, Amsterdam, 1990.

Email (forever): rvg@cs.stanford.edu
Address (at least until the end of 2003):
LFCS
School of Informatics
University of Edinburgh
James Clerk Maxwell Building
King's Buildings
Mayfield Road
Edinburgh EH9 3JZ
United Kingdom
Fax (until the end of 2003): +44 131 667 7209
Telephone (until the end of October, 2003): +44.131.560.5143
Home address

Research Interests: 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.

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

Research

Publications.

References in bibtex format, dvi, postscript and pdf (employing the vGstyle).
Abstracts

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

Ph.D. Thesis. (Introduction and table of contents).

Research by topic:

Linear Logic [50] (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]
  - SOS for ST-bisimulation [29]
- Expressiveness [31] (1994 ->)
- Iteration [36,37,38] (1995-1997)
- Scheduling algebra [40] (1996-1998) with java applet
Comparative concurrency semantics [i,6,10,14,15,17,19,26,41,43,45] (1984-present)
Models of concurrency (1987-present)
- Petri nets [ 6, 16, 34, 42, 47, 49] (1987 ->)
- Process graphs [ 8a, 43, 45, iii] (1988 ->)
- Higher dimensional automata [ii, 42] (1991 ->)
- Configuration structures [ 16,17, 34, 41, 42] (1989 ->)
- Event structures [ 10, 15,16,17, 20,21, 34, 35, 41, 42, 46, 52] (1989 ->)
- 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,27,36] (1988-1996)
Probabilistic processes [18,30] (1989-1994)
Modular specification [7,22] (1987-1990)
Interpolation [9] (1988)
Differential topology [0] (1984)

Teaching

Comparative Concurrency Semantics, Spring 1988 at the University of Amsterdam, and COMP4151, Autumn 2003 at the University of New South Wales

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

CS 352, Foundations of Control Theory, 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------

Hits since September 17, 1997:

Rob van Glabbeek

rvg@CS.Stanford.EDU