Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

THE CONCURRENCY COLUMN BRICS, Department of Computer Science

BRICS, Department of Computer Science
Aalborg University, 9220 Aalborg , Denmark
luca@cs.auc.dk, http://www.cs.auc.dk/~luca/BEATCS
This issue of the Concurrency Column is devoted to a piece on the need for
proof methodologies in process algebra. This contribution by Wan Fokkink,
Jan Friso Groote and Michel Reniers is inspired by one of the most classic ap-
plications of process algebra, viz. the verification of the correctness of proto-
cols specified using a process algebraic formalism, and in particular recounts
how the authors struggled with a correctness proof for the most complex slid-
ing window protocol presented in Tanenbaum's Computer Networks textbook
which led to the development of several useful proof techniques. The authors
have a deep knowledge of this topic, as witnessed by, e.g., their many publi-
cations and a chapter on this topic in the Handbook of Process Algebra. I thank
them for sharing their knowledge and thoughts on the status of process alge-
braic approaches to protocol verification with the community via this column.
The main message of their contribution is that, after more than a decade of
experience, it is more obvious than ever that the mathematics of process alge-


Source: Aceto, Luca - School of Computer Science, Reykjavk University
Groote, Jan Friso - Wiskunde en Informatica, Technische Universiteit Eindhoven
Reniers, Michel - Wiskunde en Informatica, Technische Universiteit Eindhoven


Collections: Computer Technologies and Information Sciences; Mathematics