Date of Original Version
Abstract or Description
In this paper we consider techniques to identify and remove redundant predicates during predicate ion. We give three criteria for identifying redundancy. A predicate is redundant if any of the following three holds (i) the predicate is equivalent to a propositional function of other predicates. (ii) removing the predicate preserves safety properties satisfied by the abstract model (iii) removing it preserves bisimulation equivalence. We also show how to efficiently remove the redundant predicates once they are identified. Experimental results are included to demonstrate the effectiveness of our methods.
W.A. Hunt, Jr. and F. Somenzi (Eds.): CAV 2003, LNCS 2725, 126-140.