Modeling and Analyzing Periodic Distributed Computations


The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on an infinite computation. In this work, we develop the theory and associated algorithms for predicate detection in infinite runs. In practice, an infinite run can be determined in… (More)
DOI: 10.1007/978-3-642-16023-3_17


6 Figures and Tables

Slides referencing similar topics