Scholar
Rob van Glabbeek
Google Scholar ID: Ngf21nIAAAAJ
UNSW
Citations & Impact
Citations
1,844
H-index
21
i10-index
49
Publications
20
Co-authors
51
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Published extensively on topics including linear logic, coinduction, session types, strategic rewriting, supervisory control theory, mutual exclusion, process algebra, recursion, specific process algebras, AWN (Algebra for Wireless Networks), ALL (Algebra for Link Layer protocols), ACP (abstraction, fairness, recursion, induction and termination), CCS and CSP, CCS extended with broadcast communication and signals, CCSP extended with time-outs, CSP and the Algebraic Theory of Effects, a branching time model of CSP, π-calculus, structural operational semantics, theory of SOS, expressiveness, (in)axiomatizability, ground-complete axiomatisations, inaxiomatizability results, completeness for open terms, iteration, scheduling algebra, timeouts, progress, justness and fairness, applications of process algebra, semantic equivalences, the linear time - branching time spectrum, and more.
Research Experience
- Royal Society Wolfson Fellow at the School of Informatics, University of Edinburgh, Scotland. Adjunct Professor at the School of Computer Science and Engineering, The University of New South Wales, Sydney 2052, Australia. Research Affiliate, Concurrency Group, Theory Division, Computer Science Department, Stanford University.
Background
- 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.
Miscellany
- Office hours: Wednesdays 14:30 – 15:30. However, you can try any other time as well; I'm often around.
