Partial-order reduction in the weak modal mu-calculus [chapter]

Y. S. Ramakrishna, Scott A. Smolka
1997 Lecture Notes in Computer Science  
We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concurrency Factory speci cation and veri cation environment; experimental results show that partial-order reduction can be highly e ective in combating state explosion in modal mu-calculus model checking.
doi:10.1007/3-540-63141-0_2 fatcat:l4mwx6qrkvh2veqtvq5onuxqty