Publication 1998 Issue No. 7 - July Abstract - Parallel Algorithms for Relational Coarsest Partition Problems
Parallel Algorithms for Relational Coarsest Partition Problems
July 1998 (vol. 9 no. 7)
pp. 687-699
 ASCII Text x Sanguthevar Rajasekaran, Insup Lee, "Parallel Algorithms for Relational Coarsest Partition Problems," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 7, pp. 687-699, July, 1998.
 BibTex x @article{ 10.1109/71.707548,author = {Sanguthevar Rajasekaran and Insup Lee},title = {Parallel Algorithms for Relational Coarsest Partition Problems},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {9},number = {7},issn = {1045-9219},year = {1998},pages = {687-699},doi = {http://doi.ieeecomputersociety.org/10.1109/71.707548},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Parallel Algorithms for Relational Coarsest Partition ProblemsIS - 7SN - 1045-9219SP687EP699EPD - 687-699A1 - Sanguthevar Rajasekaran, A1 - Insup Lee, PY - 1998KW - Bisimulation checkingKW - coarsest partition problemsKW - parallel algorithmsKW - analysis of concurrent systemsKW - labeled transition systems.VL - 9JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are ${\cal P}-{\rm 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+\epsilon})$ time using ${\textstyle{m \over {n^\epsilon}}}$ CREW PRAM processors, for any fixed $\epsilon < 1.$ This algorithm is analogous to and optimal with respect to the sequential algorithm of Kanellakis and Smolka. The second algorithm runs in O(n log n) time using ${\textstyle{m \over n}}$ CREW PRAM processors. This algorithm is analogous to and nearly optimal with respect to the sequential algorithm of Paige and Tarjan.

Index Terms:
Bisimulation checking, coarsest partition problems, parallel algorithms, analysis of concurrent systems, labeled transition systems.
Citation:
Sanguthevar Rajasekaran, Insup Lee, "Parallel Algorithms for Relational Coarsest Partition Problems," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 7, pp. 687-699, July 1998, doi:10.1109/71.707548