activity
20082017
most citedCharacterising Testing Preorders for Finite Probabilistic Processes

76 citations · 190 across the 11 of their papers we have counts for

collaborators

11 papers

cs.LO2017★ 3 cited

Distinguishing between Communicating Transactions

Vasileios Koutavas, Maciej Gazda, Matthew Hennessy

Communicating transactions is a form of distributed, non-isolated transactions which provides a simple construct for building concurrent systems. In this paper we develop a logical…

cs.LO2015★ 18 cited

Mutually Testing Processes

Giovanni Bernardi, Matthew Hennessy

In the standard testing theory of DeNicola-Hennessy one process is considered to be a refinement of another if every test guaranteed by the former is also guaranteed by the latter.…

cs.LO2014★ 9 cited

Modelling MAC-Layer Communications in Wireless Systems

Andrea Cerone, Matthew Hennessy, Massimo Merro

We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; moreover the broadcasts are subject to collisions.…

cs.LO2014★ 3 cited

Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency

Adrian Francalanza, Edsko DeVries, Matthew Hennessy

We define a pi-calculus variant with a costed semantics where channels are treated as resources that must explicitly be allocated before they are used and can be deallocated when n…

cs.LO2013★ 41 cited

Using higher-order contracts to model session types

Giovanni Bernardi, Matthew Hennessy

Session types are used to describe and structure interactions between independent processes in distributed systems. Higher-order types are needed in order to properly structure del…

cs.LO2013★ 11 cited

Modelling Probabilistic Wireless Networks

Andrea Cerone, Matthew Hennessy

We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wire…