Abstract
The transitive relation of a finite set Swith size S|S|= nis verified quickly by the relational inequality M 2≤Mthat needs 2n;3computations. In this paper, a table oriented audit method based on message passing protocol only needs computations to conduct the verification of transitive relation and it is always less than the relational inequality.