activity
20152024
most citedA Process Algebra for Wireless Mesh Networks

77 citations · 336 across the 21 of their papers we have counts for

collaborators
Showing cs.LOShow all

14 papers · 1 filter

cs.LO2024

Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures

Robert J. Colvin, Ian J. Hayes, Scott Heiner +3

Developers of low-level systems code providing core functionality for operating systems and kernels must address hardware-level features of modern multicore architectures. A partic…

cs.LO2023★ 1 cited

A Lean-Congruence Format for EP-Bisimilarity

Rob van Glabbeek, Peter Höfner, Weiyou Wang

Enabling preserving bisimilarity is a refinement of strong bisimilarity that preserves safety as well as liveness properties. To define it properly, labelled transition systems nee…

cs.LO2023

A Lean-Congruence Format for EP-Bisimilarity

Rob van Glabbeek, Peter Höfner, Weiyou Wang

Enabling preserving bisimilarity is a refinement of strong bisimilarity, which preserves safety as well as liveness properties. To define it properly, labelled transition systems n…

cs.LO2021

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

Rob van Glabbeek, Peter Höfner, Ross Horne

We investigate how different fairness assumptions affect results concerning lock-freedom, a typical liveness property targeted by session type systems. We fix a minimal session cal…

cs.LO2018★ 41 cited

Progress, Justness and Fairness

Rob van Glabbeek, Peter Höfner

Fairness assumptions are a valuable tool when reasoning about systems. In this paper, we classify several fairness properties found in the literature and argue that most of them ar…

cs.LO2018

Relational Characterisations of Paths

Rudolf Berghammer, Hitoshi Furusawa, Walter Guttmann +1

Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of b…

cs.LO2017★ 17 cited

Analysing Mutual Exclusion using Process Algebra with Signals

Victor Dyseryn, Rob van Glabbeek, Peter Höfner

In contrast to common belief, the Calculus of Communicating Systems (CCS) and similar process algebras lack the expressive power to accurately capture mutual exclusion protocols wi…

cs.LO2017★ 4 cited

Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack

Rob van Glabbeek, Peter Höfner

We present a formal model for a fragmentation and a reassembly protocol running on top of the standardised CAN bus, which is widely used in automotive and aerospace applications. A…

cs.LO2016★ 2 cited

A Timed Process Algebra for Wireless Networks

Emile Bres, Rob van Glabbeek, Peter Höfner

This paper proposes a timed process algebra for wireless networks, an extension of the Algebra for Wireless Networks. It combines treatments of local broadcast, conditional unicast…

cs.LO2015★ 77 cited

A Process Algebra for Wireless Mesh Networks

Ansgar Fehnker, Rob van Glabbeek, Peter Höfner +3

We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the…

cs.LO2015

Mechanizing a Process Algebra for Network Protocols

Timothy Bourke, Robert J. van Glabbeek, Peter Höfner

This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invar…

cs.LO2015

Proceedings Workshop on Models for Formal Analysis of Real Systems

Rob van Glabbeek, Jan Friso Groote, Peter Höfner

This volume contains the proceedings of MARS 2015, the first workshop on Models for Formal Analysis of Real Systems, held on November 23, 2015 in Suva, Fiji, as an affiliated works…

cs.LO2015★ 18 cited

CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

Rob van Glabbeek, Peter Höfner

In the process algebra community it is sometimes suggested that, on some level of abstraction, any distributed system can be modelled in standard process-algebraic specification fo…

cs.LO2015★ 15 cited

Progress, Fairness and Justness in Process Algebra

Rob van Glabbeek, Peter Höfner

To prove liveness properties of concurrent systems, it is often necessary to postulate progress, fairness and justness properties. This paper investigates how the necessary progres…