Liveness in Timed and Untimed Systems
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 calle...
| Main Authors: | , , , |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149752 |
| Summary: | 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. |
|---|