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;]

---

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;]

---