Search

• < Previous
• 1
• Next >

---

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 wireless networks, namely broadcast communication and probabilistic behaviour. We first focus on the problem of composing&nbsp;[&hellip;]

---

A calculus for costed computations

matthew hennessy.

We develop a version of the pi-calculus, picost, where channels are interpreted as resources which have costs associated with them. Code runs under the financial responsibility of owners; they must pay to use resources, but may profit by providing them. We provide a proof methodology for processes&nbsp;[&hellip;]

---

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. Based on a reduction semantics for the calculus we define a contextual equivalence to compare the external behaviour of&nbsp;[&hellip;]

---

Security Policies as Membranes in Systems for Global Computing

Daniele Gorla ; Matthew Hennessy ; Vladimiro Sassone.

We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, and a membrane, which regulates the interactions between the computing body and the external environment. More precisely,&nbsp;[&hellip;]

---

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 no longer required. We use a substructural type system tracking permission transfer to construct coinductive proof&nbsp;[&hellip;]

---

Characterising Testing Preorders for Finite Probabilistic Processes

Yuxin Deng ; Matthew Hennessy ; Rob van Glabbeek ; Carroll Morgan.

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative&nbsp;[&hellip;]

---

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. In the domain of web services this has been recast, with processes viewed as servers and tests as clients. In this way&nbsp;[&hellip;]

---

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 delegation of responsibility between processes. In this paper we show that higher-order web-service contracts can be used&nbsp;[&hellip;]

---