Concurrency and Protocol Verification
 Context: We do research on formal models of concurrency and distributed systems, and their applications in specification, analysis and verification.
 Collaboration: We cooperate with many universities and institutes, such as VU Amsterdam, U Augsburg, TU Braunschweig, Cambridge U, Trinity College Dublin, U Edinburgh, TU Eindhoven, INRIA, Shanghai Jiaotong U and Stanford U.
Activities
Current focus is on the following projects:
 Multicore seL4 Verification: We aim to provide frameworks for reasoning about concurrency in code for operating systems. In particular, our main project is to model and verify the multicore version of seL4.
 Formal Specification, Analysis and Verification of Mesh Protocols: We strive to develop methods and formalisms for protocol specification, analysis and verification. Amongst others we apply those methods and formalisms to routing protocols for wireless mesh networks, such as AODV, the Ad hoc Ondemand Distance Vector routing protocol. Additionally, we work on improvements of existing protocols and/or creation of new ones.
 Analysis of Protocols for Highassurance Networks: We aim to provide authentication and reliable communication protocols for unmanned aerial vehicles (UAVs). This covers both internal communication within the UAV and external communication between a ground station and the vehicle.
 Process Algebra: We study process algebraic languages and their semantics, in order to provide a firm theoretical basis for the specification, analysis and verification of concurrent systems.
 Asynchronous Communication in Distributed Systems: We aim to discover which systems can be implemented in a distributed way—and how—using only asynchronous communication between components, while preserving desirable properties that may be specified in terms of synchronous communication. In connection with this, we try to establish an expressiveness hierarchy of specification formalisms with different communication paradigms.
 Probability and Nondeterminism: The goal of this project is to build a theory of processes that faithfully integrates probabilities and nondeterminism.
Recent Publications
2020
Rob van Glabbeek Reactive bisimulation semantics for a process algebra with timeouts 31st International Conference on Concurrency Theory (CONCUR 20), pp. 6:16:23, Online, August, 2020  
Rob van Glabbeek Reactive bisimulation semantics for a process algebra with timeouts Technical Report, Data61, CSIRO, August, 2020  
Rob van Glabbeek Reactive temporal logic Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on Structural Operational Semantics (EXPRESS/SOS 2020), pp. 5168, Online, August, 2020  
Rob van Glabbeek, Bas Luttik and Linda Spaninks Rooted divergencepreserving branching bisimilarity is a congruence Logical Methods in Computer Science, Volume 16, Issue 3, pp. 14:014;16, August, 2020  
Rob van Glabbeek, Vincent Gramoli and Pierre Tholoniat Feasibility of crosschain payment with success guarantees 32nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2020, pp. 579581, Virtual event, July, 2020  
Rob van Glabbeek and Kees Middelburg On infinite guarded recursive specifications in process algebra Technical Report, Data61, CSIRO, May, 2020  
Ryan Barry, Rob van Glabbeek and Peter Hoefner Formalising the optimised link state routing protocol 4th Workshop on Models for Formal Analysis of Real Systems (MARS 2020), pp. 4071, Dublin, Ireland, April, 2020  
Jack Drury, Peter Hoefner and Weiyou Wang Formal models of the OSPF routing protocol MARS2020, pp. 72–120, Dublin, Ireland, April, 2020 
2019
Rob van Glabbeek, Vincent Gramoli and Pierre Tholoniat Crosschain payment protocols with success guarantees Technical Report, Data61, CSIRO, December, 2019  
Rob van Glabbeek, Jan Friso Groote and Erik de Vink A complete axiomatization of branching bisimilarity for a simple process language with probabilistic choice The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy — Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, pp. 139162, Paris, November, 2019  
Rob van Glabbeek, Ursula Goltz, Christopher Lippert and Mennicke Stephan Stronger validity criteria for encoding synchrony The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy — Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, pp. 182205, Paris, November, 2019  
Wan Fokkink, Rob van Glabbeek and Bas Luttik Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence Information and Computation, Volume 268, October, 2019  

Robert Sison and Toby Murray Verifying that a compiler preserves concurrent valuedependent informationflow security International Conference on Interactive Theorem Proving, pp. 27:1–27:19, Portland, USA, September, 2019  
Wan Fokkink and Rob van Glabbeek Proceedings 30th international conference on concurrency theory (CONCUR 2019) Volume 140 in Leibniz International Proceedings in Informatics (LIPIcs) 140. Schloss Dagstuhl—LeibnizZentrum für Informatik, Amsterdam, August, 2019  
Rob van Glabbeek Ensuring liveness properties of distributed systems: Open problems Journal of Logical and Algebraic Methods in Programming, Volume 109, pp. 119, August, 2019  
Rob van Glabbeek On the meaning of transition system specifications Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, pp. 69–85, Amsterdam, The Netherlands, August, 2019  
Rob van Glabbeek and Peter Hoefner Progress, justness and fairness ACM Computing Surveys, Volume 52, Issue 4, pp. 69:1–69:38, August, 2019  
Rob van Glabbeek Reward testing equivalences for processes Models, Languages, and Tools for Concurrent and Distributed Programming, Essays Dedicated to Rocco De Nicola on the Occasion of His 65th Birthday, pp. 4570, Volume 11665 in Lecture Notes in Computer Science, Springer, 2019  
Johannes Åman Pohjola Psicalculi revisited: Connectivity and compositionality FORTE 2019: International Conference on Formal Techniques for Distributed Systems, pp. 320, Lyngby, Denmark, June, 2019 Best paper award.  
Johannes Åman Pohjola Psicalculi revisited: Connectivity and compositionality Technical Report, Data61, CSIRO, April, 2019  
Peter Hoefner, Rob van Glabbeek and Michael Markl A process algebra for link layer protocols Proceedings of the 28th European Symposium on Programming, Prague, Czech Republic, April, 2019  
Rob van Glabbeek Justness: A completeness criterion for capturing liveness properties Proceedings of the 22nd International Conference on Foundations of Software Science and Computational Structures, pp. 505522, Prague, Czech Republic, April, 2019  
Nick Fischer and Rob van Glabbeek Axiomatising infinitary probabilistic weak bisimilarity of finitestate behaviours Journal of Logical and Algebraic Methods in Programming, Volume 102, pp. 64102, January, 2019 
2018
Callum Bannister and Peter Hoefner False failure: Creating failure models for separation logic 17th International Conference on Relational and Algebraic Methods in Computer Science, pp. 263279, Groningen, October, 2018  
Alejandro GomezLondono and Johannes Åman Pohjola Connecting choreography languages with verified stacks at Nordic Workshop on Programming Theory, Oslo, Norway, October, 2018  
Rob van Glabbeek and Peter Hoefner Progress, justness and fairness Technical Report, Data61, CSIRO, October, 2018  
Rob van Glabbeek On the validity of encodings of the synchronous in the asynchronous πcalculus Information Processing Letters, Volume 137, pp. 1725, September, 2018  
Rob van Glabbeek Is speedindependent mutual exclusion implementable? Proceedings of the 29th International Conference on Concurrency Theory (CONCUR), Beijing, China, September, 2018  
Rob van Glabbeek, Peter Hoefner and Djurre van der Wal Analysing AWNspecifications using mCRL2 (extended abstract) 14th International Conference on integrated Formal Methods, pp. 398418, Maynooth, September, 2018  
Callum Bannister, Peter Hoefner and Gerwin Klein Backwards and forwards with separation logic International Conference on Interactive Theorem Proving, pp. 68–87, Oxford, July, 2018  
Toby Murray, Robert Sison and Kai Engelhardt COVERN: A logic for compositional verification of information flow control European Conference on Security and Privacy (EuroS&P), London, United Kingdom, April, 2018  
Rob van Glabbeek A theory of encodings and expressiveness Proceedings of the 21st International Conference on Foundations of Software Science and Computational Structures, pp. 183202, Thessaloniki, Greece, April, 2018  
John Gallager, Rob van Glabbeek and Wendelin Serwe Proceedings third workshop on models for formal analysis of real systems and sixth international workshop on verification and program transformation Volume 268 in EPTCS 268. Open Publishing Association, Thessaloniki, Greece, March, 2018  
Rudolf Berghammer, Hitoshi Furusawa, Walter Guttmann and Peter Hoefner Relational characterisations of paths Technical Report, Data61, CSIRO, January, 2018  
Annabelle McIver, Carroll Morgan, Benjamin Kaminski and JoostPieter Katoen A new proof rule for almostsure termination ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, Los Angeles, January, 2018  

Robert Sison Perthread compositional compilation for confidentialitypreserving concurrent programs 2nd Workshop on Principles of Secure Compilation, Los Angeles, January, 2018 
2017
Rob van Glabbeek and Wan Fokkink Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity Information and Computation, Volume 257, pp. 79113, December, 2017  
June Andronick From Hoare logic to OwickiGries and relyguarantee for interruptible eChronos and multicore seL4 International Colloquium on Theoretical Aspects of Computing (ICTAC), pp. XIIIXV, Hanoi, Vietnam, October, 2017  
Darren Cofer, John Backes, Andrew Gacek, Daniel DaCosta, Michael Whalen, Ihor Kuz, Gerwin Klein, Gernot Heiser, Lee Pike, Adam Foltzer, Michael Podhradsky, Douglas Stuart, Jason Graham and Brett Wilson Secure mathematicallyassured composition of control models Technical Report, Data61, CSIRO, September, 2017  
Wan Fokkink, Rob van Glabbeek and Bas Luttik Divide and congruence III: Stability & divergence Proceedings of the 28th International Conference on Concurrency Theory (CONCUR), pp. 15:115:16, Berlin, Germany, September, 2017  
June Andronick Reasoning about concurrency in highassurance, highperformance software systems International Conference on Automated Deduction, pp. 1–7, Gothenburg, August, 2017  
Victor Dyseryn, Rob van Glabbeek and Peter Hoefner Analysing mutual exclusion using process algebra with signals Combined International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics (EXPRESS/SOS), Berlin, August, 2017  
Wan Fokkink and Rob van Glabbeek Precongruence formats with lookahead through modal decomposition 26th EACSL Annual Conference on Computer Science Logic (CSL'17), Stockholm, Sweden, August, 2017  
Rob van Glabbeek Lean and full congruence formats for recursion Proceedings of the 32nd Annual IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, August, 2017  
Peter Hoefner, Damien Pous and Georg Struth Relational and algebraic methods in computer science (proceedings) in Lecture Notes in Computer Science. Springer, Lyon, France, May, 2017  
Holger Hermanns and Peter Hoefner Preface: Proceedings of the 2nd workshop on models for formal analysis of real systems Electronic Proceedings in Theoretical Computer Science, pp. , 2017  
Peter Hoefner, Damien Pous and Georg Struth Preface: Proceedings of the 16th conference on relational and algebraic methods in computer science Lecture Notes in Computer Science, pp. 2, 2017  
Rob van Glabbeek and Peter Hoefner Split, send, reassemble: A formal specification of a CAN bus protocol stack 2nd Workshop on Models for Formal Analysis of Real Systems (MARS 2017), pp. 1452, Uppsala, Sweden, April, 2017  
Peter Hoefner and Holger Hermanns Proceedings of the 2nd workshop on models for formal analysis of real systems Volume 244 in Electronic Proceedings in Theoretical Computer Science 244. Open Publishing Association, Uppsala, Sweden, March, 2017  
Sidney Amani, June Andronick, Maksym Bortin, Corey Lewis, Christine Rizkallah and Joey Tuong COMPLX: A verification framework for concurrent imperative programs International Conference on Certified Programs and Proofs, pp. 138–150, Paris, France, January, 2017  
Rob van Glabbeek A branching time model of CSP Concurrency, Security, and Puzzles  Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday, pp. 272293, Volume 10160 in Lecture Notes in Computer Science, Springer, 2017 
2016
Rudolf Berghammer, Nikita Danilenko, Peter Hoefner and Insa Stucke Cardinality of relations with applications Discrete Mathematics, Volume 339, Number 12, pp. 3089–3115, December, 2016  
Rob van Glabbeek An algebraic treatment of recursion Liber Amicorum for Jan Bergstra, pp. 5859, University of Amsterdam, 2016  
June Andronick, Corey Lewis, Daniel Matichuk, Carroll Morgan and Christine Rizkallah Proof of OS scheduling behavior in the presence of interruptinduced concurrency International Conference on Interactive Theorem Proving, pp. 52–68, Nancy, France, August, 2016  
Rob van Glabbeek, Peter Hoefner, Marius Portmann and Wee Lum Tan Modelling and verifying the AODV routing protocol Distributed Computing, Volume 29, Number 4, pp. 279–315, August, 2016  
Wan Fokkink and Rob van Glabbeek Divide and congruence II: delay and weak bisimilarity Proceedings of the 31st Annual IEEE Symposium on Logic in Computer Science, pp. 778–787, New York City, USA, July, 2016  
Peter Hoefner and Bernhard Möller Extended feature algebra Journal of Logical and Algebraic Methods in Programming, Volume 85, Number 5, pp. 952–971, June, 2016  
Rudolf Berghammer, Peter Hoefner and Insa Stucke Cardinality of relations and relational approximation algorithms Journal of Logical and Algebraic Methods in Programming, Volume 85, Number 2, pp. 269–286, May, 2016  
Emile Bres, Rob van Glabbeek and Peter Hoefner A timed process algebra for wireless networks with an application in routing (extended abstract) European Symposium on Programming, pp. 95–122, Eindhoven, The Netherlands, April, 2016  
Wan Fokkink and Rob van Glabbeek Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity Technical Report 9351, NICTA, April, 2016  
Timothy Bourke, Rob van Glabbeek and Peter Hoefner Mechanizing a process algebra for network protocols Journal of Automated Reasoning, Volume 56, Number 3, pp. 309–341, March, 2016  
Emile Bres, Rob van Glabbeek and Peter Hoefner A timed process algebra for wireless networks with an application in routing Technical Report, NICTA, February, 2016 
2015

June Andronick, Corey Lewis and Carroll Morgan Controlled OwickiGries concurrency: reasoning about the preemptible eChronos embedded operating system Workshop on Models for Formal Analysis of Real Systems (MARS 2015), pp. 10–24, Suva, Fiji, November, 2015  
Rob van Glabbeek, Jan Friso Groote and Peter Hoefner Preface: Proceedings of the workshop on models for formal analysis of real systems Electronic Proceedings in Theoretical Computer Science, pp. , Open Publishing Association, 2015  
Peter Hoefner Using process algebra to design better protocols (abstract) Forum “MathforIndustry” 2015, pp. 31–33, Fukuoka, Japan, October, 2015  
Rudolf Berghammer, Peter Hoefner and Insa Stucke Toolbased verification of a relational vertex coloring program International Conference on Relational and Algebraic Methods in Computer Science, pp. 18, Braga, September, 2015  
Mojgan Kamali, Peter Hoefner, Maryam Kamali and Luigia Petre Formal analysis of proactive, distributed routing Software Engineering and Formal Methods, pp. 15, York, UK, September, 2015  
Rob van Glabbeek Structure preserving bisimilarity, supporting an operational petri net semantics of CCSP Correct System Design — Symposium in Honor of ErnstRüdiger Olderog on the Occasion of His 60th Birthday, pp. 99–130, Oldenburg, Germany, September, 2015  
Rob van Glabbeek, Taolue Chen and Wan Fokkink On the axiomatizability of impossible futures Logical Methods in Computer Science, Volume 11, Number 3, pp. 1–31, September, 2015  
Kirstin Peters and Rob van Glabbeek Analysing and comparing encodability criteria Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, pp. 46–60, Madrid, Spain, August, 2015  
Rob van Glabbeek, Ursula Goltz and ErnstRüdiger Olderog Special issue on ``Combining Compositionality and Concurrency'': Part 2 Acta Informatica, pp. 303–304, Springer, 2015  
Wolfram Kahl, Timothy G. Griffin and Peter Hoefner Preface: Special issue on relational and algebraic methods in computer science Journal of Logical and Algebraic Methods in Programming, pp. 283–284, 2015  
Rob van Glabbeek and Peter Hoefner CCS: It's not fair! Fair schedulers cannot be implemented in CCSlike languages even under progress and certain fairness assumptions Acta Informatica, Volume 52, Number 23, pp. 175–205, April, 2015  
Don Batory, Peter Hoefner, Dominik Köppl and Bernhard Möller Structured document algebra in action Lecture Notes in Computer Science, Volume 8950, pp. 291–311, March, 2015  
Rob van Glabbeek, Ursula Goltz and ErnstRüdiger Olderog Special issue on ``Combining Compositionality and Concurrency'': Part 1 Acta Informatica, pp. 3–4, Springer, 2015  
Rob van Glabbeek and Peter Hoefner Progress, fairness and justness in process algebra Technical Report 8501, NICTA, January, 2015 
2014
Timothy Bourke, Rob van Glabbeek and Peter Hoefner A mechanized proof of loop freedom of the (untimed) AODV routing protocol International Symposium on Automated Technology for Verification and Analysis (ATVA), pp. 47–63, Sydney, Australia, November, 2014  
Timothy Bourke, Rob van Glabbeek and Peter Hoefner Showing invariance compositionally for a process algebra for network protocols International Conference on Interactive Theorem Proving, pp. 44–59, Vienna, Austria, July, 2014  
Yuxin Deng, Rob van Glabbeek, Matthew Hennessy and Carroll Morgan Real reward testing for probabilistic processes Theoretical Computer Science, Volume 538, pp. 16–36, July, 2014  
Peter Hoefner, Peter Jipsen, Wolfram Kahl and Martin Eric Müller Preface: Relational and algebraic methods in computer science Lecture Notes in Computer Science, pp. 2, 2014  
Rudolf Berghammer, Peter Hoefner and Insa Stucke Automated verification of relational whileprograms International Conference on Relational and Algebraic Methods in Computer Science, pp. 16, Marienstatt im Westerwald, Germany, April, 2014  
Peter Hoefner and Annabelle McIver Hopscotch—reaching the target hop by hop Journal of Logical and Algebraic Methods in Programming (JLAMP), Volume 83, Number 2, pp. 212–224, April, 2014 
2013
Ansgar Fehnker, Rob van Glabbeek, Peter Hoefner, Annabelle McIver, Marius Portmann and Wee Lum Tan A process algebra for wireless mesh networks used for modelling, verifying and analysing AODV Technical Report 5513, NICTA, December, 2013  
Rob van Glabbeek, Peter Hoefner, Wee Lum Tan and Marius Portmann Sequence numbers do not guarantee loop freedom — AODV can yield routing loops 16th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 91–100, Barcelona, Spain, November, 2013  
Don Batory, Peter Hoefner, Bernhard Möller and Andreas Zelend Features, modularity, and variation points Fifth International Workshop on FeatureOriented Software Development (FOSD), pp. 8, Indianapolis, Indiana, USA, October, 2013  
Rob van Glabbeek, Ursula Goltz and JensWolfhard SchickeUffmann On characterising distributability Logical Methods in Computer Science, Volume 9, Number 3, pp. 1–58, September, 2013  
Tyler Crain, Vincent Gramoli and Michel Raynal A contentionfriendly binary search tree 19th International Conference on Parallel Processing, pp. 229–240, Aachen, Germany, August, 2013  
Ansgar Fehnker, Peter Hoefner, Maryam Kamali and Vinay Mehta Topologybased mobility models for wireless networks Proceedings of the 10th International Conference on Quantitative Evaluation of SysTems, pp. 16, Buenos Aires, Argentina, August, 2013  
Peter Hoefner and Maryam Kamali Quantitative analysis of AODV and its variants on dynamic topologies using statistical model checking 11th International Conference on Formal Modeling and Analysis of Timed Systems, pp. 15, Buenos Aires, Argentina, August, 2013  
Peter Hoefner and Annabelle McIver Statistical model checking of wireless mesh routing protocols 5th NASA Formal Methods Symposium (NFM 2013), pp. 15, Moffett Field, CA, USA, May, 2013 
2012
Peter Hoefner and Sarah Edenhofer Towards a rigorous analysis of AODVv2 (DYMO) 2nd International Workshop on Rigorous Protocol Engineering (WRiPE 2012), pp. 1–6, Austin, Texas, October, 2012  
Peter Hoefner, Rob van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle McIver and Ansgar Fehnker A rigorous analysis of AODV and its variants 15th ACM/IEEE International Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM 2012), pp. 203–212, Paphos, Cyprus, October, 2012  
Peter Hoefner, Bernhard Möller and Andreas Zelend Foundations of coloring algebra with consequences for featureoriented programming International Conference on Relational and Algebraic Methods in Computer Science, pp. 16, Cambridge, UK, September, 2012  
Peter Hoefner Towards a representation theorem for coloring algebra Abstract, Workshop on Lattices and Relations, August, 2012.  
Peter Hoefner Kleene modules for routing procedures Abstract, Workshop on Lattices and Relations, August, 2012.  
Rob van Glabbeek Musings on encodings and expressiveness Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics, pp. 81—98, Newcastle upon Tyne, United Kingdom, August, 2012  
Peter Hoefner, Rob van Glabbeek and Ian Hayes Preface—Morgan: A suitable case for treatment Formal Aspects of Computing, Volume 24, Number 46, pp. 417–422, July, 2012  
Peter Hoefner and Bernhard Möller Dijkstra, Floyd and Warshall meet Kleene Formal Aspects of Computing (FAOC), Volume 24, Number 46, pp. 459–476, July, 2012  
Wan Fokkink, Rob van Glabbeek and Paulien de Wind Divide and congruence: From decomposition of modal formulas to preservation of branching and ηbisimilarity Information and Computation, Volume 214, Number , pp. 59–85, May, 2012  
Ansgar Fehnker, Rob van Glabbeek, Peter Hoefner, Annabelle McIver, Marius Portmann and Wee Lum Tan A process algebra for wireless mesh networks Proceedings of the 21st European Symposium on Programming, pp. 295–315, Tallinn, Estonia, March, 2012  
Ansgar Fehnker, Rob van Glabbeek, Peter Hoefner, Annabelle McIver, Marius Portmann and Wee Lum Tan Automated analysis of AODV using UPPAAL Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp. 173–187, Tallinn, Estonia, March, 2012  
Rob van Glabbeek, Ursula Goltz and JensWolfhard SchickeUffmann On distributability of petri nets (extended abstract) Proceedings of the 15th International Conference on Foundations of Software Science and Computational Structures, pp. 331–345, Tallinn, Estonia, March, 2012 
2011
Rob van Glabbeek Bisimulation Encyclopedia of Parallel Computing, pp. 136–139, Volume 1 in , Springer, 2011  
Ansgar Fehnker, Rob van Glabbeek, Peter Hoefner, Annabelle McIver, Marius Portmann and Wee Lum Tan Modelling and analysis of AODV in UPPAAL 1st International Workshop on Rigorous Protocol Engineering, pp. 1–6, Vancouver, October, 2011  
Peter Hoefner, Don Batory and Jongwook Kim Feature interactions, products, and composition Generative Programming and Component Engineering (GPCE'11), pp. 13–22, Portland, OR, United States, October, 2011  
Rob van Glabbeek, Ursula Goltz and JensWolfhard Schicke On causal semantics of petri nets (extended abstract) Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR), pp. 43–59, Aachen, Germany, September, 2011  
Yuxin Deng, Rob van Glabbeek, Matthew Hennessy and Carroll Morgan Real reward testing for probabilistic processes (extended abstract) Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL 2011), pp. 61–73, Saarbrücken, Germany, July, 2011  
Peter Hoefner, Ridha Khedri and Bernhard Möller Supplementing product families with behaviour International Journal of Software and Informatics (IJSI), Volume 5, Number 12, Part II, pp. 245–266, July, 2011  
Rob van Glabbeek, Ursula Goltz and JensWolfhard Schicke Abstract processes of place/transition systems Information Processing Letters, Volume 111, Number 13, pp. 626–633, July, 2011  
HanHing Dang, Bernhard Möller and Peter Hoefner Algebraic separation logic The Journal of Logic and Algebraic Programming, Volume 80, Number 6, pp. 221–247, June, 2011  
Peter Hoefner and Bernhard Möller Fixing zeno gaps Theoretical Computer Science, Volume 412, Number 28, pp. 3303–3322, June, 2011  
Rob van Glabbeek On cool congruence formats for weak bisimulations Theoretical Computer Science, Volume 412, Number 28, pp. 3283–3302, June, 2011  
Peter Hoefner and Annabelle McIver Towards an algebra of routing tables 12th International Conference on Relational and Algebraic Methods in Computer Science, pp. 212–229, Rotterdam, Netherlands, May, 2011 
2010
Yuxin Deng and Rob van Glabbeek Characterising probabilistic processes logically (extended abstract) Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pp. 278–293, Yogyakarta, Indonesia, October, 2010  
Rob van Glabbeek The coarsest precongruences respecting safety and liveness properties Theoretical Computer Science 2010, pp. 32–52, Brisbane, September, 2010  
Rob van Glabbeek and Gordon Plotkin On CSP and the algebraic theory of effects Reflections on the Work of C.A.R. Hoare, pp. 333–369, Volume in History of Computing, Springer, 2010 
2009
Rob van Glabbeek, Bas Luttik and Nikola Trčka Computation tree logic with deadlock detection Logical Methods in Computer Science, Volume 5, Number 4:5, pp. 1–24, December, 2009  
Rob van Glabbeek and Gordon Plotkin Configuration structures, event structures and petri nets Theoretical Computer Science, Volume 410, Number 41, pp. 4111–4159, September, 2009  
Yuxin Deng, Rob van Glabbeek, Matthew Hennessy and Carroll Morgan Testing finitary probabilistic processes (extended abstract) Proceedings of the 20th International Conference on Concurrency Theory (CONCUR), pp. 274–288, Bologna, Italy, August, 2009  
Rob van Glabbeek, Ursula Goltz and JensWolfhard Schicke Symmetric and asymmetric asynchronous interaction Electronic Notes in Theoretical Computer Science, Volume 229, Number 3, pp. 77–95, July, 2009  
Rob van Glabbeek, Bas Luttik and Nikola Trčka Branching bisimilarity with explicit divergence Fundamenta Informaticae, Volume 93, Number 4, pp. 371–392, June, 2009  
Rob van Glabbeek and Peter D. Mosses Preface, special issue on structural operational semantics Information and Computation, pp. 83–84, Elsevier, 2009  
Taolue Chen, Wan Fokkink and Rob van Glabbeek On finite bases for weak semantics: Failures versus impossible futures 35th Conference on Current Trends in Theory and Practice of Computer Science, pp. 167–180, Spindleruv Mlyn, Czech Republic , January, 2009 
2008
Taolue Chen, Wan Fokkink and Rob van Glabbeek Ready to preorder: The case of weak process semantics Information Processing Letters, Volume 109, Number 2, pp. 104–111, December, 2008  
Yuxin Deng, Rob van Glabbeek, Matthew Hennessy and Carroll Morgan Characterising testing preorders for finite probabilistic processes Logical Methods in Computer Science, Volume 4, Number 4, pp. 1–33, October, 2008  
Rob van Glabbeek, Ursula Goltz and JensWolfhard Schicke On synchronous and asynchronous interaction in distributed systems 33nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), pp. 16–35, Torun, Poland, August, 2008  
Rob van Glabbeek, Ursula Goltz and JensWolfhard Schicke Symmetric and asymmetric asynchronous interaction First Interaction and Concurrency Experience (ICE'08): Synchronous and Asynchronous Interactions in Concurrent Distributed Systems, pp. 5–22, Reykjavik, Iceland, July, 2008 Best student/young researcher paper.  
Rob van Glabbeek and Bas Ploeger Correcting a spaceefficient simulation algorithm Proceedings of the 20th International Conference on Computer Aided Verification, pp. 517–529, Princeton, USA, July, 2008  
Rob van Glabbeek and Bas Ploeger Five determinisation algorithms 13th International Conference on Implementation and Application of Automata, pp. 161–170, San Francisco, July, 2008 
2007
Rob van Glabbeek and Matthew Hennessy Preface, proceedings of the 4th workshop on structural operational semantics Electronic Notes in Theoretical Computer Science, pp. 1–3, Elsevier, 2007  
Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan and Cuicui Zhang Characterising testing preorders for finite probabilistic processes Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, pp. 313–322, Wroclaw, Poland, July, 2007  
Rob van Glabbeek and Peter D. Mosses Preface, proceedings of the 3rd workshop on structural operational semantics Electronic Notes in Theoretical Computer Science, pp. 1–2, Elsevier, 2007  
Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan and Cuicui Zhang Remarks on testing probabilistic processes Electronic Notes in Theoretical Computer Science, Volume 172, Number , pp. 359–397, April, 2007  
Yuxin Deng, Rob van Glabbeek, Carroll Morgan and Chenyi Zhang Scalar outcomes suffice for finitary probabilistic testing Proceedings of the 16thEuropean Symposium on Programming, pp. 363–378, Braga, Portugal, March, 2007 