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

---

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

---

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

---

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

---