UNSW   Faculty of Engineering PRINT VERSIONSITE MAP  
cse | School of Computer Science and Engineering (CRICOS Provider No. 00098G)
    #About CSE     #Undergraduate Study     #Postgraduate Study     #Timetables & Courses     #Research & Publications     #People & Work Units     #Help & Resources     #News & Events     #High School Portal
Rob van Glabbeek's Information Page

Rob van Glabbeek

Professor NICTA Conjoint

To update this page please go to myCSE.
Office:
L5 NICTA
Phone:
83060492
Fax:
83060405
Email:
rvg AT cse.unsw.edu.au
Mail:
School of Computer Science and Engineering
The University of New South Wales
Sydney 2052, Australia
Personal Website:
Further details are in my Home Page
Research Areas
  • Concurrency
Publications
Scalar Outcomes Suffice For Finitary Probabilistic Testing
Y Deng, R van Glabbeek, C Morgan, C Zhang, Programming languages and systems, R. De Nicola.
Springer, New York, 2007, pp. 363 - 378
Remarks On Testing Probabilistic Processes
Y Deng, R van Glabbeek, M Hennessy, C Morgan, C Zhang, Electronic Notes in Theoretical Computer Science, .
Elsevier, Online, 2007, pp. 359 - 397
Preface
R van Glabbeek, Electornic notes in theoretical computer science, .
Elsevier, Amsterdam, The Netherlands, 2007
Preface
R van Glabbeek, M Hennessy, Electronic notes in theoretical computer science, .
Elsevier, Amsterdam, The Netherlands, 2007
Characterising Testing Preorders For Finite Probabilistic Processes
Y Deng, R van Glabbeek, M Hennessy, C Morgan, C Zhang, 22nd Annual IEEE symposium on logic in computer science, Proceedings, .
IEEE computer society press, Los Alamitos, USA, 2007, pp. 313 - 322
On The Expressiveness Of Higher Dimensional Automata
R van Glabbeek, Theoretical Computer Science, J. Baeten, F. Corradini.
Elsevier, Amsterdam, Netherlands, 2006, pp. 265 - 290
Liveness, Fairness And Impossible Futures
R van Glabbeek, M Voorhoeve, Concurrency theory---CONCUR 2006, C. Baier, H. Hermanns.
Springer-Verlag Berlin, Berlin, 2006, pp. 126 - 141
Divide And Congruence: From Decomposition Of Modalities To Preservation Of Branching Bisimulation
W Fokkink, R van Glabbeek, P de Wind, Formal methods for components and objects, F. de Boer, et al..
Springer-Verlag Berlin, Berlin, 2006, pp. 195 - 218
Divide And Congruence Applied To N-Bisimulation
W Fokkink, R van Glabbeek, P de Wind, Electronic Notes in Theoretical Computer Science 156 2006 (1-2), Mislove.
Elsevier, Amsterdam, 2006, pp. 97 - 113
Compositionality Of Hennessy-Milner Logic By Structural Operational Semantics
W Fokkink, R van Glabbeek, P de Wind, Theoretical Computer Science, A. Lingas, L. Gasieniec.
Elsevier Science Bv, Amsterdam, 2006, pp. 421 - 440
The Individual And Collective Token Interpretations Of Petri Nets
R van Glabbeek, Proceedings of the 16th international conference on concurrency theory, .
Springer-Verlag Berlin, Berlin, 2005, pp. 323 - 337
Proof Nets For Unit-Free Multiplicative Additive Linear Logic
R van Glabbeek, D Hughes, ACM transactions on computational logic, .
ACM, New York, 2005, pp. 784 - 842
On The Expressiveness Of Higher Dimensional Automata: (Extended Abstract)
R van Glabbeek, Electronic Notes in Theoretical Computer Science, .
Elsevier BV, Amsterdam, Netherlands, 2005, pp. 5 - 34
On Cool Congruence Formats For Weak Bisimulations
R van Glabbeek, Proceedings of the international colloquium on theoretical aspects of computing, .
Springer-Verlag Berlin, Berlin, 2005, pp. 318 - 333
A Characterisation For Weak Bisimulation Congruence
R van Glabbeek, Processes, terms and cycles: Steps on the road to infinity, .
Springer, Berlin, 2005

To update this page please go to myCSE
Top Of Page

 ###
Site maintained by webmistress@cse.unsw.edu.au
Please read the UNSW Copyright & Disclaimer Statement