The Community for Technology Leaders
ABSTRACT
<p><b>Abstract</b>—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are <tmath>${\cal P}-{\rm complete}$</tmath> 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 <it>m</it> transitions and <it>n</it> states. The first algorithm runs in <tmath>$O(n^{1+\epsilon})$</tmath> time using <tmath>${\textstyle{m \over {n^\epsilon}}}$</tmath> CREW PRAM processors, for any fixed <tmath>$\epsilon < 1.$</tmath> This algorithm is analogous to and optimal with respect to the sequential algorithm of Kanellakis and Smolka. The second algorithm runs in <it>O</it>(<it>n</it> log <it>n</it>) time using <tmath>${\textstyle{m \over n}}$</tmath> CREW PRAM processors. This algorithm is analogous to and nearly optimal with respect to the sequential algorithm of Paige and Tarjan.</p>
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 & Distributed Systems, vol. 9, no. , pp. 687-699, July 1998, doi:10.1109/71.707548
FULL ARTICLE
CITATIONS
SHARE
98 ms
(Ver 3.3 (11022016))