Rob J. van Glabbeek

Affiliations:
  • Data61, CSIRO, Sydney, Australia
  • Stanford University, USA


According to our database1, Rob J. van Glabbeek authored at least 153 papers between 1987 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Comparing the expressiveness of the π-calculus and CCS.
Proceedings of the Programming Languages and Systems, 2022

2021
Failure Trace Semantics for a Process Algebra with Time-outs.
Log. Methods Comput. Sci., 2021

Abstract processes and conflicts in place/transition systems.
Inf. Comput., 2021

Modelling Mutual Exclusion in a Process Algebra with Time-outs.
CoRR, 2021

Coinductive Validity.
CoRR, 2021

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Enabling Preserving Bisimulation Equivalence.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

CONCUR Test-Of-Time Award 2021 (Invited Paper).
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence.
Log. Methods Comput. Sci., 2020

Reactive Temporal Logic.
Proceedings of the Proceedings Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on Structural Operational Semantics, 2020

On infinite guarded recursive specifications in process algebra.
CoRR, 2020

Formalising the Optimised Link State Routing Protocol.
Proceedings of the 4th Workshop on Models for Formal Analysis of Real Systems, 2020

Failure Trace Semantics for a Process Algebra with Time-outs (preliminary report).
CoRR, 2020

Feasibility of Cross-Chain Payment with Success Guarantees.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Reactive Bisimulation Semantics for a Process Algebra with Time-Outs.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours.
J. Log. Algebraic Methods Program., 2019

Ensuring liveness properties of distributed systems: Open problems.
J. Log. Algebraic Methods Program., 2019

Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence.
Inf. Comput., 2019

Progress, Justness, and Fairness.
ACM Comput. Surv., 2019

Cross-Chain Payment Protocols with Success Guarantees.
CoRR, 2019

Justness: A Completeness Criterion for Capturing Liveness Properties.
CoRR, 2019

On the Meaning of Transition System Specifications.
Proceedings of the Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, 2019

Justness - A Completeness Criterion for Capturing Liveness Properties (Extended Abstract).
Proceedings of the Foundations of Software Science and Computation Structures, 2019

A Process Algebra for Link Layer Protocols.
Proceedings of the Programming Languages and Systems, 2019

A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice - (Extended Abstract).
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

Stronger Validity Criteria for Encoding Synchrony.
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

Reward Testing Equivalences for Processes.
Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

2018
On the validity of encodings of the synchronous in the asynchronous <i>π</i>-calculus.
Inf. Process. Lett., 2018

A Theory of Encodings and Expressiveness.
CoRR, 2018

On the Validity of Encodings of the Synchronous in the Asynchronous π-calculus.
CoRR, 2018

Analysing AWN-Specifications Using mCRL2 (Extended Abstract).
Proceedings of the Integrated Formal Methods - 14th International Conference, 2018

A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract).
Proceedings of the Foundations of Software Science and Computation Structures, 2018

Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk).
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity.
Inf. Comput., 2017

Ensuring Liveness Properties of Distributed Systems (A Research Agenda).
CoRR, 2017

Analysing Mutual Exclusion using Process Algebra with Signals.
Proceedings of the Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics, 2017

Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack.
Proceedings of the Proceedings 2nd Workshop on Models for Formal Analysis of Real Systems, 2017

An Algebraic Treatment of Recursion.
CoRR, 2017

Lean and full congruence formats for recursion.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Precongruence Formats with Lookahead through Modal Decomposition.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

Divide and Congruence III: Stability & Divergence.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

A Branching Time Model of CSP.
Proceedings of the Concurrency, Security, and Puzzles, 2017

2016
Mechanizing a Process Algebra for Network Protocols.
J. Autom. Reason., 2016

Modelling and verifying the AODV routing protocol.
Distributed Comput., 2016

MALL proof nets identify proofs modulo rule commutation.
CoRR, 2016

A Timed Process Algebra for Wireless Networks.
CoRR, 2016

Divide and Congruence II: Delay and Weak Bisimilarity.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract).
Proceedings of the Programming Languages and Systems, 2016

2015
Analysing and Comparing Encodability Criteria.
Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, 2015

Progress, Fairness and Justness in Process Algebra.
CoRR, 2015

Modelling and Analysis of AODV in UPPAAL.
CoRR, 2015

On the Axiomatizability of Impossible Futures.
Log. Methods Comput. Sci., 2015

Analysing and Comparing Encodability Criteria for Process Calculi.
Arch. Formal Proofs, 2015

CCS: It's not fair! - Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions.
Acta Informatica, 2015

Special issue on "Combining Compositionality and Concurrency": part 2.
Acta Informatica, 2015

Special issue on "Combining Compositionality and Concurrency": part 1.
Acta Informatica, 2015

Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP.
Proceedings of the Correct System Design, 2015

2014
Real-reward testing for probabilistic processes.
Theor. Comput. Sci., 2014

Showing Invariance Compositionally for a Process Algebra for Network Protocols.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
On Characterising Distributability.
Log. Methods Comput. Sci., 2013

A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV.
CoRR, 2013

Sequence numbers do not guarantee loop freedom: AODV can yield routing loops.
Proceedings of the 16th ACM International Conference on Modeling, 2013

2012
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity.
Inf. Comput., 2012

Musings on Encodings and Expressiveness
Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

On Distributability of Petri Nets
CoRR, 2012

Automated Analysis of AODV Using UPPAAL.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

A rigorous analysis of AODV and its variants.
Proceedings of the 15th ACM International Conference on Modeling, 2012

On Distributability of Petri Nets - (Extended Abstract).
Proceedings of the Foundations of Software Science and Computational Structures, 2012

A Process Algebra for Wireless Mesh Networks.
Proceedings of the Programming Languages and Systems, 2012

2011
Bisimulation.
Proceedings of the Encyclopedia of Parallel Computing, 2011

On cool congruence formats for weak bisimulations.
Theor. Comput. Sci., 2011

Abstract processes of place/transition systems.
Inf. Process. Lett., 2011

Real-Reward Testing for Probabilistic Processes (Extended Abstract)
Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

On Causal Semantics of Petri Nets.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
On CSP and the Algebraic Theory of Effects
CoRR, 2010

Characterising Probabilistic Processes Logically
CoRR, 2010

Characterising Probabilistic Processes Logically - (Extended Abstract).
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

The Coarsest Precongruences Respecting Safety and Liveness Properties.
Proceedings of the Theoretical Computer Science, 2010

On CSP and the Algebraic Theory of Effects.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009
Configuration structures, event structures and Petri nets.
Theor. Comput. Sci., 2009

Special issue on structural operational semantics.
Inf. Comput., 2009

Branching Bisimilarity with Explicit Divergence.
Fundam. Informaticae, 2009

Symmetric and Asymmetric Asynchronous Interaction.
Electron. Notes Theor. Comput. Sci., 2009

Computation Tree Logic with Deadlock Detection
Log. Methods Comput. Sci., 2009

On Finite Bases for Weak Semantics: Failures Versus Impossible Futures.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Testing Finitary Probabilistic Processes.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Characterising Testing Preorders for Finite Probabilistic Processes.
Log. Methods Comput. Sci., 2008

Ready to preorder: The case of weak process semantics.
Inf. Process. Lett., 2008

Five Determinisation Algorithms.
Proceedings of the Implementation and Applications of Automata, 2008

On Synchronous and Asynchronous Interaction in Distributed Systems.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Correcting a Space-Efficient Simulation Algorithm.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007
Preface.
Electron. Notes Theor. Comput. Sci., 2007

Preface.
Electron. Notes Theor. Comput. Sci., 2007

Remarks on Testing Probabilistic Processes.
Electron. Notes Theor. Comput. Sci., 2007

Characterising Testing Preorders for Finite Probabilistic Processes.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Scalar Outcomes Suffice for Finitary Probabilistic Testing.
Proceedings of the Programming Languages and Systems, 2007

2006
Erratum to "On the expressiveness of higher dimensional automata": [TCS 356 (2006) 265-290].
Theor. Comput. Sci., 2006

On the expressiveness of higher dimensional automata.
Theor. Comput. Sci., 2006

Compositionality of Hennessy-Milner logic by structural operational semantics.
Theor. Comput. Sci., 2006

On Specifying Timeouts.
Electron. Notes Theor. Comput. Sci., 2006

Divide and Congruence Applied to <i>eta</i>-Bisimulation.
Electron. Notes Theor. Comput. Sci., 2006

Liveness, Fairness and Impossible Futures.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Proof nets for unit-free multiplicative-additive linear logic.
ACM Trans. Comput. Log., 2005

Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation.
Proceedings of the Formal Methods for Components and Objects, 4th International Symposium, 2005

The Individual and Collective Token Interpretations of Petri Nets.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

A Characterisation of Weak Bisimulation Congruence.
Proceedings of the Processes, 2005

2004
Precongruence formats for decorated trace semantics.
ACM Trans. Comput. Log., 2004

Well-behaved flow event structures for parallel composition and action refinement.
Theor. Comput. Sci., 2004

The meaning of negative premises in transition system specifications II.
J. Log. Algebraic Methods Program., 2004

Nested semantics over finite trees are equationally hard.
Inf. Comput., 2004

On the Expressiveness of Higher Dimensional Automata: (Extended Abstract).
Proceedings of the 11th International Workshop on Expressiveness in Concurrency, 2004

Event Structures for Resolvable Conflict.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract).
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Compositionality of Hennessy-Milner Logic through Structural Operational Semantics.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Bundle Event Structures and CCSP.
Proceedings of the CONCUR 2003, 2003

Query Nets: Interacting Workflow Modules That Ensure Global Termination.
Proceedings of the Business Process Management, International Conference, 2003

2002
Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow.
Proceedings of the Applications and Theory of Petri Nets 2002, 2002

2001
Refinement of actions and equivalence notions for concurrent systems.
Acta Informatica, 2001

What is Branching Time Semantics and Why to Use it?
Proceedings of the Current Trends in Theoretical Computer Science, 2001

The Linear Time - Branching Time Spectrum I.
Proceedings of the Handbook of Process Algebra, 2001

2000
Preface.
Inf. Comput., 2000

Precongruence Formats for Decorated Trace Preorders.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1999
Petri Nets, Configuration Structures and Higher Dimensional Automata.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Scheduling Algebra.
Proceedings of the Algebraic Methodology and Software Technology, 1998

1997
Notes on the Methodology of CCS and CSP.
Theor. Comput. Sci., 1997

The Difference between Splitting in n and n+1.
Inf. Comput., 1997

Axiomatizing Flat Iteration.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Branching Time and Abstraction in Bisimulation Semantics.
J. ACM, 1996

Ntyft/Ntyxt Rules Reduce to Ntree Rules.
Inf. Comput., 1996

Axiomatizing Prefix Iteration with Silent Steps.
Inf. Comput., 1996

1995
Reactive, Generative and Stratified Models of Probabilistic Processes
Inf. Comput., August, 1995

Configuration Structures
Proceedings of the Proceedings, 1995

1994
What is Branching time semantics and why to use it?
Bull. EATCS, 1994

Axiomatising ST-Bisimulation Equivalence.
Proceedings of the Programming Concepts, 1994

1993
Modular Specification of Process Algebras.
Theor. Comput. Sci., 1993

A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

The Linear Time - Branching Time Spectrum II.
Proceedings of the CONCUR '93, 1993

Full Abstraction in Structural Operational Semantics (Extended Abstract).
Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1992
Interleaving semantics and action refinement with atomic choice.
Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1990
Equivalences and Refinement.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Reactive, Generative, and Stratified Models of Probabilistic Processes
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

The Refinement Theorem for ST-bisimulation Semantics.
Proceedings of the Programming concepts and methods: Proceedings of the IFIP Working Group 2.2, 1990

The Linear Time-Branching Time Spectrum (Extended Abstract).
Proceedings of the CONCUR '90, 1990

1989
Parial order semantics for refinement of actions - neither necessary nor always sufficient but appropriate when used with care.
Bull. EATCS, 1989

Refinement of Actions in Causality Based Models.
Proceedings of the Stepwise Refinement of Distributed Systems, 1989

Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract).
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1987
Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra.
Proceedings of the STACS 87, 1987

Petri Net Models for Algebraic Theories of Concurrency.
Proceedings of the PARLE, 1987

Another Look at Abstraction in Process Algebra (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Merge and Termination in Process Algebra.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

Modular Specifications in Process Algebra with Curious Queues.
Proceedings of the Algebraic Methods: Theory, 1987


  Loading...