Correctness Proofs of Distributed Termination Algorithms [chapter]

Krzysztof R. Apt
1985 Logics and Models of Concurrent Systems  
The problem of correctness of the solutions to the distributed termination problem of Francez [7] is addressed. Correctness criteria are formalized in the customary framework for program correctness. A very simple proof method is proposed and applied to show correctness of a solution to the problem. It allows us to reason about liveness properties of temporal logic (see, e.g., Manna and Pnueli [12]) using a new notion of weak total correctness. J is a global invariant of S. Observe now that J
more » ... TERMINA TEDn -done1 due to 16and11, and J /\ TERMINATED2 --, detected1 due to ls and 111 • Thus, J /\ TERMINATED2 /\ TERMINATEDn -TERMINATED 1 • That is, J /\ [• TERMINATED1 /\ Vi (i # 1 -TERMINATED;)] is unsatisfiable.
doi:10.1007/978-3-642-82453-1_6 dblp:conf/nato/Apt84 fatcat:ij3u5rbxxjco3b73sn5rqkpeom