Parallel Algorithms for Relational Coarsest Partition Problems

—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to design polylog time parallel algorithms for these problems. In this paper, we present two efficient parallel algorithms for RCPP in which its associated label transition system is assumed to have m transitions and n states. The first algorithm runs in O(n 1+⑀ ) time using m n ⑀

• Type: Journal
• Year: 1998
• Where: TPDS
• Authors: Sanguthevar Rajasekaran, Insup Lee
• Keywords: Algorithm, Coarsest Partition Problems, TPDS 1998, Vital Role