Generalized Fair Reachability Analysis for Cyclic Protocols with Nondeterminism and Internal Transitions
| dc.contributor.author | Liu, Hong | en_US |
| dc.contributor.author | Miller, Raymond E. | en_US |
| dc.date.accessioned | 2004-05-31T21:03:01Z | |
| dc.date.available | 2004-05-31T21:03:01Z | |
| dc.date.created | 1995-02 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | In this paper, we extend the generalized fair reachability notion to cyclic protocols with nondeterminism and internal transitions. By properly incorporating internal transitions into the formulation of fair progress vectors, we prove that most of the results established for cyclic protocols without nondeterminism and internal transitions still hold even if nondeterminism and internal transitions are allowed. We identify indefiniteness as a new type of logical error resulting from reachable internal execution cycles and show that indefiniteness can also be detected for the class of cyclic protocols with finite fair reachable state spaces with finite extensions. | en_US |
| dc.format.extent | 213899 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/424 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | Computer Science Department Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3422 | en_US |
| dc.title | Generalized Fair Reachability Analysis for Cyclic Protocols with Nondeterminism and Internal Transitions | en_US |
| dc.type | Technical Report | en_US |