By Topic

Protocol Specification and Verification Using Process Algebra and Petri Nets

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 $13
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

3 Author(s)
Simonak, S. ; Dept. of Comput. & Inf., Tech. Univ. of Kosice, Kosice, Slovakia ; Hudak, S. ; Korecko, S.

The paper deals with the issue of the verification of communication protocols based on integration of formal methods chosen (a process algebra and Petri nets). A method is proposed, that uses the process algebra for protocol specification, and transformation rules for a translation of the specification into a Petri net while preserving the semantics of the specification. Petri nets are well-known formal method for their analytical power to deal with a problem of protocol verification: invariant, reachability, deadlock and liveness analysis. Elements of theory behind the method are sketched in a short way. The elegance of protocol specification by using the process algebra and a powerful analysis by means of Petri nets are main reasons for such the integration, what is demonstrated in the paper. The method is illuminated by an example: simple data link layer network protocol known as Alternating bit protocol (ABP).

Published in:

Computational Intelligence, Modelling and Simulation, 2009. CSSim '09. International Conference on

Date of Conference:

7-9 Sept. 2009