Efficient compositional state-space verification for communicating processes in distributed systems

Compositional verification has been considered as one of the most promising approaches to attack the state explosion problem. However, current techniques still can not efficiently verify modern distributed systems due to the high interleaved execution of asynchronously sending actions. The paper presents a new methodology for the compositional verification of deadlock states. The contribution of our methodology is that it can efficiently eliminate the interleaved execution of asynchronously sending actions and invisible actions. Experimental results show significant improvement over other methods.