A modular approach to protocol verification using process algebra

Publication date

1986-04

Authors

Koymans, C.P.J.
Mulder, J.C.

Editors

Advisors

Supervisors

DOI

Document Type

Preprint
Open Access logo

License

Abstract

A version of the Alternating Bit Protocol is verified by means of Process Algebra. To avoid a combinatorial explosion, a notion of "modules" is introduced and the protocol is divided in two such modules. A method is developed for verifying conglomerates of modules and applied to the motivating example.

Keywords

process algebra, concurrency, communication protocol, verification, fairness, module

Citation