By Topic

On improving reachability analysis for verifying progress properties of networks of CFSMs

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

2 Author(s)
van der Schoot, H. ; Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont., Canada ; Ural, H.

State explosion is well-known to be the principle limitation in protocol verification. In this paper, leaping reachability analysis (LRA) is advocated as an incremental improvement of a verification technique called simultaneous reachability analysis (SRA) to tackle state explosion. SRA is a relief strategy for the verification of progress properties of protocols modeled as networks of communicating finite state machines (CFSMs) without any topological or structural constraints. The improvement is a uniform and property-driven relief strategy which proves to be adequate for detecting all deadlocks, all non-executable transitions, all unspecified receptions and all buffer overflows in a protocol specified in the CFSM model. Experiments show that LRA can largely relieve the state explosion problem by reducing the amount of storage space and execution time required for verification

Published in:

Distributed Computing Systems, 1998. Proceedings. 18th International Conference on

Date of Conference:

26-29 May 1998