
Enabling Preserving Bisimulation Equivalence
Most fairness assumptions used for verifying liveness properties are cri...
read it

Modelling Mutual Exclusion in a Process Algebra with Timeouts
I show that in a standard process algebra extended with timeouts one ca...
read it

Assuming Just Enough Fairness to make Session Types Complete for Lockfreedom
We investigate how different fairness assumptions affect results concern...
read it

Coinductive Validity
This note formally defines the concept of coinductive validity of judgem...
read it

Abstract Processes and Conflicts in Place/Transition Systems
For onesafe Petri nets or condition/eventsystems, a process as defined...
read it

On Causal Semantics of Petri Nets
We consider approaches for causal semantics of Petri nets, explicitly re...
read it

Reactive Temporal Logic
Whereas standard treatments of temporal logic are adequate for closed sy...
read it

Reactive Bisimulation Semantics for a Process Algebra with TimeOuts
This paper introduces the counterpart of strong bisimilarity for labelle...
read it

Feasibility of CrossChain Payment with Success Guarantees
We consider the problem of crosschain payment whereby customers of diff...
read it

Formalising the Optimised Link State Routing Protocol
Routing protocol specifications are traditionally written in plain Engli...
read it

Failure Trace Semantics for a Process Algebra with Timeouts (preliminary report)
This paper extends a standard process algebra with a timeout operator, ...
read it

CrossChain Payment Protocols with Success Guarantees
In this paper, we consider the problem of crosschain payment whereby cu...
read it

Justness: A Completeness Criterion for Capturing Liveness Properties
This paper poses that transition systems constitute a good model of dist...
read it

On the Meaning of Transition System Specifications
Transition System Specifications provide programming and specification l...
read it

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...
read it

Reward Testing Equivalences for Processes
May and must testing were introduced by De Nicola and Hennessy to define...
read it

A Process Algebra for Link Layer Protocols
We propose a process algebra for link layer protocols, featuring a uniqu...
read it

Axiomatising Infinitary Probabilistic Weak Bisimilarity of FiniteState Behaviours
In concurrency theory, weak bisimilarity is often used to relate process...
read it

Progress, Justness and Fairness
Fairness assumptions are a valuable tool when reasoning about systems. I...
read it

A Theory of Encodings and Expressiveness
This paper proposes a definition of what it means for one system descrip...
read it

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...
read it

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...
read it

Rooted DivergencePreserving Branching Bisimilarity is a Congruence
We prove that rooted divergencepreserving branching bisimilarity is a c...
read it

Ensuring Liveness Properties of Distributed Systems (A Research Agenda)
Often fairness assumptions need to be made in order to establish livenes...
read it

Proceedings Workshop on Models for Formal Analysis of Real Systems
This volume contains the proceedings of MARS 2015, the first workshop on...
read it
Rob van Glabbeek
is this you? claim profile