cient Veri cation of Symmetric Concurrent Systems

Previously, we proposed a reduction technique ID93] based on symmetries to alleviate the state explosion problem in automatic veriication of concurrent systems. This paper describes the results of testing the technique on a wide range of algorithms and protocols, including realistic multiprocessor synchronization algorithms and cache coherence protocols. Memory requirements were reduced by amounts ranging from 83% to over 99%, and time requirements were often reduced as well. We also consider the effectiveness of the technique on diierent types of symmetries , such as symmetries in identical system components and symmetries in data values.