Rob van Glabbeek

research

∙ 09/13/2023

A Cancellation Law for Probabilistic Processes

We show a cancellation property for probabilistic choice. If distributio...

0 Rob van Glabbeek, et al. ∙

research

∙ 08/30/2023

A Lean-Congruence Format for EP-Bisimilarity

Enabling preserving bisimilarity is a refinement of strong bisimilarity,...

0 Rob van Glabbeek, et al. ∙

research

∙ 12/21/2022

Fair Must Testing for I/O Automata

The concept of must testing is naturally parametrised with a chosen comp...

0 Rob van Glabbeek, et al. ∙

research

∙ 12/17/2022

Just Testing

The concept of must testing is naturally parametrised with a chosen comp...

0 Rob van Glabbeek, et al. ∙

research

∙ 07/10/2022

Abstract Processes in the Absence of Conflicts in General Place/Transition Systems

Goltz and Reisig generalised Petri's concept of processes of one-safe Pe...

0 Rob van Glabbeek, et al. ∙

research

∙ 03/22/2022

Comparing the expressiveness of the π-calculus and CCS

This paper shows that the π-calculus with implicit matching is no more e...

0 Rob van Glabbeek, et al. ∙

research

∙ 07/31/2021

Enabling Preserving Bisimulation Equivalence

Most fairness assumptions used for verifying liveness properties are cri...

0 Rob van Glabbeek, et al. ∙

research

∙ 06/24/2021

Modelling Mutual Exclusion in a Process Algebra with Time-outs

I show that in a standard process algebra extended with time-outs one ca...

0 Rob van Glabbeek, et al. ∙

research

∙ 04/29/2021

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom

We investigate how different fairness assumptions affect results concern...

0 Rob van Glabbeek, et al. ∙

research

∙ 04/27/2021

Coinductive Validity

This note formally defines the concept of coinductive validity of judgem...

0 Rob van Glabbeek, et al. ∙

research

∙ 03/02/2021

Abstract Processes and Conflicts in Place/Transition Systems

For one-safe Petri nets or condition/event-systems, a process as defined...

0 Rob van Glabbeek, et al. ∙

research

∙ 03/01/2021

On Causal Semantics of Petri Nets

We consider approaches for causal semantics of Petri nets, explicitly re...

0 Rob van Glabbeek, et al. ∙

research

∙ 08/31/2020

Reactive Temporal Logic

Whereas standard treatments of temporal logic are adequate for closed sy...

0 Rob van Glabbeek, et al. ∙

research

∙ 08/26/2020

Reactive Bisimulation Semantics for a Process Algebra with Time-Outs

This paper introduces the counterpart of strong bisimilarity for labelle...

0 Rob van Glabbeek, et al. ∙

research

∙ 07/16/2020

Feasibility of Cross-Chain Payment with Success Guarantees

We consider the problem of cross-chain payment whereby customers of diff...

0 Rob van Glabbeek, et al. ∙

research

∙ 04/28/2020

Formalising the Optimised Link State Routing Protocol

Routing protocol specifications are traditionally written in plain Engli...

0 Ryan Barry, et al. ∙

research

∙ 02/25/2020

Failure Trace Semantics for a Process Algebra with Time-outs (preliminary report)

This paper extends a standard process algebra with a time-out operator, ...

0 Rob van Glabbeek, et al. ∙

research

∙ 12/10/2019

Cross-Chain Payment Protocols with Success Guarantees

In this paper, we consider the problem of cross-chain payment whereby cu...

0 Rob van Glabbeek, et al. ∙

research

∙ 08/31/2019

Justness: A Completeness Criterion for Capturing Liveness Properties

This paper poses that transition systems constitute a good model of dist...

0 Rob van Glabbeek, et al. ∙

research

∙ 08/23/2019

On the Meaning of Transition System Specifications

Transition System Specifications provide programming and specification l...

0 Rob van Glabbeek, et al. ∙

research

∙ 08/19/2019

Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence

In two earlier papers we derived congruence formats with regard to trans...

0 Wan Fokkink, et al. ∙

research

∙ 07/31/2019

Reward Testing Equivalences for Processes

May and must testing were introduced by De Nicola and Hennessy to define...

0 Rob van Glabbeek, et al. ∙

research

∙ 07/31/2019

A Process Algebra for Link Layer Protocols

We propose a process algebra for link layer protocols, featuring a uniqu...

0 Rob van Glabbeek, et al. ∙

research

∙ 10/17/2018

Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State Behaviours

In concurrency theory, weak bisimilarity is often used to relate process...

0 Nick Fischer, et al. ∙

research

∙ 10/17/2018

Progress, Justness and Fairness

Fairness assumptions are a valuable tool when reasoning about systems. I...

0 Rob van Glabbeek, et al. ∙

research

∙ 05/26/2018

A Theory of Encodings and Expressiveness

This paper proposes a definition of what it means for one system descrip...

0 Rob van Glabbeek, et al. ∙

research

∙ 03/23/2018

Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation

This volume contains the joint proceedings of MARS 2018, the third works...

0 John P. Gallagher, et al. ∙

research

∙ 02/26/2018

On the Validity of Encodings of the Synchronous in the Asynchronous π-calculus

Process calculi may be compared in their expressive power by means of en...

0 Rob van Glabbeek, et al. ∙

research

∙ 01/03/2018

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

We prove that rooted divergence-preserving branching bisimilarity is a c...

0 Rob van Glabbeek, et al. ∙

research

∙ 11/12/2017

Ensuring Liveness Properties of Distributed Systems (A Research Agenda)

Often fairness assumptions need to be made in order to establish livenes...

0 Rob van Glabbeek, et al. ∙

research

∙ 11/08/2015

Proceedings Workshop on Models for Formal Analysis of Real Systems

This volume contains the proceedings of MARS 2015, the first workshop on...

0 Rob van Glabbeek, et al. ∙

Rob van Glabbeek

Featured Co-authors