Communicating sequential processes
Communicating sequential processes
Three partition refinement algorithms
SIAM Journal on Computing
SIAM Journal on Computing
Communication and concurrency
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Improved deterministic parallel integer sorting
Information and Computation
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Towards efficient parallelization of equivalence checking algorithms
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
On the computational complexity of bisimulation, redux
Information and Computation
Computing the maximum bisimulation with spiking neural P systems
Computation, cooperation, and life
Parallelizing a new algorithm for the set partition problem
Annales UMCS, Informatica
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
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