By Topic

Generalized fair reachability analysis for cyclic protocols: decidability for logical correctness problems

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
$33 $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)
Hong Liu ; Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA ; R. E. Miller

In a previous paper, we generalized the fair reachability notion to cyclic protocols with n⩾2 machines and showed that deadlock detection is decidable for 𝒫, the class of cyclic protocols whose fair reachable state spaces are finite. In this paper, we show that detection of unspecified receptions, unboundedness, and nonexecutable transitions are all decidable for class 𝒫 via finite extension of the fair reachable state space. This study shows that for the class 𝒫, our generalized fair reachability analysis technique not only achieves substantial state reduction but also maintains very competitive logical error coverage. Therefore, it is a viable state reduction technique

Published in:

Network Protocols, 1994. Proceedings., 1994 International Conference on

Date of Conference:

25-28 Oct 1994