A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation

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

• Type: Conference
• Year: 1994
• Where: CAV
• Authors: Insup Lee, Sanguthevar Rajasekaran
• Keywords: CAV 1994, Coarsest Partition Problems, Hardware, Parallel Algorithm, Time Parallel Algorithms