By Topic

Reduced reachability graphs with parallel actions and dynamic replacement

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

1 Author(s)
Mountassir, H. ; Lab. d''Inf., Besancon, France

Analysis of communication protocols by the conventional state exploration is a well known technique. It is actually implemented in several tools of validation. The major problem of this technique is its restricted applicability and depends on the available memory. The number of reachable states is often large and sometimes infinite. In this paper we discuss a reduction technique to build small graphs as possible which preserve same properties. At this end vectors of executable actions are proposed to eliminate redundancy of sequences and intermediate states. The depth-first and the breadth-first algorithms based on the concept of dynamic replacement are used in the order to reduce the final graphs. Two major questions are discussed: the finiteness of the graphs and the verification of the communication properties

Published in:

Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on  (Volume:2 )

Date of Conference:

19-21 Apr 1995