By Topic

An extended algebra for the validation of communication protocols

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lombardo, A. ; Fac. di Ingegneria, Catania Univ., Italy ; Palazzo, S.

This paper presents a simple algebra for the validation of communication protocols modelled as state-transition systems. It is based on an original extension to the Protocol validation algebra by Holzmann (1982), enhanced with additional facilities such as operators for handling parallelism among communicating processes and rules for obtaining the specification of a composed process from those of the components. The semantics of the algebraic operators provide for a validation technique, through which some protocol properties can be verified, such as termination, deadlock freeness, livelock freeness, absence of residuals and conformity of the protocol to the service. A brief description of a software tool which implements the method is given

Published in:

Software Engineering Journal  (Volume:4 ,  Issue: 3 )