Liveness in Timed and Untimed Systems
Name
MIT-LCS-TR-587.pdf
Size
8.99 MB
Format
Adobe PDF
Checksum (MD5)
ebc89265becb879b9c23a7c4859ba37b
Author(s) • • •
Gawlick, Rainer
Segala, Roberto
Søgaard-Andersen, Jørgen
Lynch, Nancy A.
Date Issued
December 1993
Series/Report no.
MIT-LCS-TR-587
Abstract
When 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.
Persistent DSpace Link