On Improving Simultaneous Reachability Analysis for the Efficient Verification of Deadlock-Freedom (1995)
by
Hans van der Schoot
,
Hasan Ural
| Citations: | 4 - 4 self |
BibTeX
@MISC{Schoot95onimproving,
author = {Hans van der Schoot and Hasan Ural},
title = {On Improving Simultaneous Reachability Analysis for the Efficient Verification of Deadlock-Freedom},
year = {1995}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In [11], simultaneous reachability analysis is proposed as a relief strategy for the verification of progress properties of bounded protocols. A bounded protocol is defined as a network of n >= 2 finite-state processes communicating over bounded, error-free simplex channels. This paper presents an enhancement of simultaneous reachability analysis which yields a significant reduction of the storage space and execution time required for deadlock detection.
