On Detection of Bounded Global Predicates

Abstract

Distributed programs often follow some bounded global predicates, e.g., the total number of certain tokens is always the same or bounded in a range. In order to detect bounded global predicates, we can first derive the minimum and maximum global snapshots and then check if the minimum and maximum are out of the range. Recently, Groselj[9] proposed an efficient method to derive the minimum global snapshot by reducing this problem to a maximum network flow problem. A restriction of this method is that all values must be non-negative. In this paper, we propose an elegant technique, called normalization. By using this technique, we can easily derive the minimum and maximum global snapshots and also remove the restriction of being non-negative.