Process algebra is a widely accepted and much used technique in the specification and
verification of parallel and distributed software systems. This book sets the standard for the …

In order to describe probabilistic processes by means of a formal model, some
considerations have to be taken into account. In this paper we present some of the ideas …

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 …

This book presents the fundamentals of concurrency theory with clarity and rigor. The
authors start with the semantic structure, namely labelled transition systems, which provides …

This paper presents a formal specification of the Ad hoc On-demand Distance Vector
(AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process …

We propose AWN (Algebra for Wireless Networks), a process algebra tailored to the
modelling of Mobile Ad hoc Network (MANET) and Wireless Mesh Network (WMN) …

This paper presents some new results on barbed equivalences for the π-calculus. The
equivalences studied are barbed congruence and a variant of it called open barbed …

The story that leads to this thesis began back in May 1996, when Kees Middelburg visited
Kiev with lectures on process algebra and SDL semantics, and invited me to work on these …

We introduce a process calculus with a new prefixing operator that allows us to model
locally controlled reversibility. Actions can be undone spontaneously, as in other reversible …

A formal approach for the design and analysis of concurrent systems is proposed which
integrates two different orthogonal aspects of time:(i) the aspect of probabilistic-time …