Abstract In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Our algorithm uses only O(n) control messages to detect the predicate once it becomes true, where n is the number of processes. Moreover, it does not require application messages to be modified to carry control information (e.g., vector timestamps). Key words: stable property, termination, deadlock, global virtual time and predicate detectio
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.