loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth International Conference on Computer Communications and Networks (ICCCN '95)
Reachability Problems for Cyclic Protocols
Las Vegas, Nevada, USA
September 20-September 23
ISBN: 0-8186-7180-7
ASCII Text
x 
 
Hong Liu, Raymond E. Miller, "Reachability Problems for Cyclic Protocols," Computer Communications and Networks, International Conference on, pp. 0032, Fourth International Conference on Computer Communications and Networks (ICCCN '95), 1995.
 
 
BibTex
x
 
@article{ 10.1109/ICCCN.1995.540099,
author = {Hong Liu and Raymond E. Miller},
title = {Reachability Problems for Cyclic Protocols},
journal ={Computer Communications and Networks, International Conference on},
volume = {0},
year = {1995},
isbn = {0-8186-7180-7},
pages = {0032},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICCCN.1995.540099},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Communications and Networks, International Conference on
TI - Reachability Problems for Cyclic Protocols
SN - 0-8186-7180-7
SP
EP
A1 - Hong Liu,
A1 - Raymond E. Miller,
PY - 1995
KW - Communication Protocols
KW - Verification
KW - Reachability Analysis
KW - Fair Reachability Analysis
KW - State Explosion
VL - 0
JA - Computer Communications and Networks, International Conference on
ER -
 
Hong Liu, Univ. of Maryland at College Park
Raymond E. Miller, Univ. of Maryland at College Park
In this paper, we study three reachability problems for cyclic protocols: (1) global state reachability; (2) abstract state reachability; and (3) execution cycle reachability. By combining fair progress and maximal progress during state exploration, we prove that these three problems are all decidable for {\cal Q}, the class of cyclic protocols with finite fair reachable state spaces. In the course of the investigation, we also show that detection of k-indefiniteness and k-livelock are decidable for {\cal Q}.
Index Terms:
Communication Protocols, Verification, Reachability Analysis, Fair Reachability Analysis, State Explosion
Citation:
Hong Liu, Raymond E. Miller, "Reachability Problems for Cyclic Protocols," icccn, pp.0032, Fourth International Conference on Computer Communications and Networks (ICCCN '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.