DocumentCode
3318579
Title
Reachability problems for cyclic protocols
Author
Liu, Hong ; Miller, Raymond E.
Author_Institution
Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
fYear
1995
fDate
20-23 Sep 1995
Firstpage
32
Lastpage
39
Abstract
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 an all decidable for 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 an decidable for Q
Keywords
protocols; reachability analysis; state-space methods; abstract state reachability; cyclic protocols; decidable problems; execution cycle reachability; fair progress; finite fair reachable state spaces; global state reachability; maximal progress; reachability problems; state exploration; Automata; Computer science; Educational institutions; Explosions; Interleaved codes; NASA; Protocols; Reachability analysis; Safety; State-space methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks, 1995. Proceedings., Fourth International Conference on
Conference_Location
Las Vegas, NV
Print_ISBN
0-8186-7180-7
Type
conf
DOI
10.1109/ICCCN.1995.540099
Filename
540099
Link To Document