Show simple item record

Generalized Fair Reachability Analysis for Cyclic Protocols with Nondeterminism and Internal Transitions

dc.contributor.authorLiu, Hongen_US
dc.contributor.authorMiller, Raymond E.en_US
dc.date.accessioned2004-05-31T21:03:01Z
dc.date.available2004-05-31T21:03:01Z
dc.date.created1995-02en_US
dc.date.issued1998-10-15en_US
dc.identifier.urihttp://hdl.handle.net/1903/424
dc.description.abstractIn 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.extent213899 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3422en_US
dc.titleGeneralized Fair Reachability Analysis for Cyclic Protocols with Nondeterminism and Internal Transitionsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtComputer Science Department Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record