A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Faster possibility detection by combining two approaches
[chapter]
1995
Lecture Notes in Computer Science
A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read "possibly Φ"), meaning the system could have passed through a global state satisfying Φ. Like the algorithm of Cooper and Marzullo, Φ may be any global state predicate; and like the algorithm of Garg and Waldecker, Poss Φ is detected quite efficiently if Φ has a certain structure. The new algorithm exploits the structure of some predicates Φ not handled by
doi:10.1007/bfb0022156
fatcat:zrhwtgp6wnhsfifcuxfvzsmqpa