Show simple item record

dc.contributor.authorGawlick, Raineren_US
dc.contributor.authorSegala, Robertoen_US
dc.contributor.authorSøgaard-Andersen, Jørgenen_US
dc.contributor.authorLynch, Nancy A.en_US
dc.date.accessioned2023-03-29T15:20:56Z
dc.date.available2023-03-29T15:20:56Z
dc.date.issued1993-12
dc.identifier.urihttps://hdl.handle.net/1721.1/149752
dc.description.abstractWhen proving the correctness of algorithms in distributed systems, one generally considers safety conditions and liveness conditions. The Input /Output (I/)0 automaton model and its timed version have used successfully, but have focused on safety conditions and on a restricted from of liveness called fairness.en_US
dc.relation.ispartofseriesMIT-LCS-TR-587
dc.titleLiveness in Timed and Untimed Systemsen_US
dc.identifier.oclc42844924


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record