
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
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. 687699, 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 = {10459219}, year = {1998}, pages = {687699}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.707548}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Parallel Algorithms for Relational Coarsest Partition Problems IS  7 SN  10459219 SP687 EP699 EPD  687699 A1  Sanguthevar Rajasekaran, A1  Insup Lee, PY  1998 KW  Bisimulation checking KW  coarsest partition problems KW  parallel algorithms KW  analysis of concurrent systems KW  labeled transition systems. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are
[1] C. Alvarez, J.L. Balcazar, J. Gabarro, and M. Santha, Parallel Complexity in the Design and Analysis of Concurrent Systems. SpringerVerlag, 1991.
[2] H. BenAbdallah, D. Clarke, I. Lee, and O. Sokolsky, "PARAGON: A Paradigm for the Specification, Verification, and Testing of RealTime Systems," Proc. IEEE Aerospace Conf., pp. 469488, 1997.
[3] J. Bergstra and J. Klop, "Algebra of Communicating Processes with Abstraction," J. Theoretical Computer Science, vol. 37, pp. 77121, 1985.
[4] P.C.P. Bhatt, K. Diks, T. Hagerup, V.C. Prasad, T. Radzik, and S. Saxena, "Improved Deterministic Parallel Integer Sorting," Information and Computation, pp. 2947, 1991.
[5] R.P. Brent, "The Parallel Evaluation of General Arithmetic Expressions," J. ACM, vol. 21, pp. 201206, 1974.
[6] E.M. Clarke and J.M. Wing, "Formal Methods: State of the Art and Future Directions," ACM Computing Surveys, vol. 28, no. 4, pp. 626643, 1996.
[7] R. Cleaveland, J.N. Gada, P.M. Lewis, S.A. Smolka, O.V. Sokolsky, and S. Zhang, "The Concurrency Factory—Practical Tools for Specification, Simulation, Verification, and Implementation of Concurrent Systems," Proc. DIMACS Workshop on Specification Techniques for Concurrent Systems,Princeton, N.J., 1994.
[8] R. Cleaveland, J. Parrow, and B. Steffen, "The Concurrency Workbench: A SemanticsBased Tool for the Verification of Concurrent Systems," ACM Trans. Programming Languages and Systems, Jan. 1993, pp. 3672.
[9] R. Cleaveland and S.A. Smolka, "Strategic Directions in Concurrency Research," ACM Computing Surveys, vol. 28, no. 4, pp. 607625, 1996.
[10] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, pp. 770785, 1988.
[11] J.C. Fernandez, "An Implementation of an Efficient Algorithm for Bisimulation Equivalence," Science of Computer Programming, vol. 13, pp. 219236, 1989/90.
[12] C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, Englewood Cliffs, N.J., 1985.
[13] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: AddisonWesley, 1992.
[14] P.C. Kanellakis and S.A. Smolka, "CCS Expressions, Finite State Processes, and Three Problems of Equivalence," Proc. Second Ann. ACM Symp. Principles of Distributed Computing, pp. 228240, 1983.
[15] P.C. Kanellakis and S.A. Smolka, "CCS Expressions, Finite State Processes, and Three Problems of Equivalence," Information and Computation, pp. 4368, vol. 86, 1990.
[16] R.E. Ladner and M.J. Fischer, "Parallel Prefix Computation," J. ACM, vol. 27, no. 4, pp. 831838, Oct. 1980.
[17] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[18] R. Milner, Communication and Concurrency, PrenticeHall, Englewood Cliffs, N.J., 1989.
[19] R. Paige and R.E. Tarjan, "Three Partition Refinement Algorithms," SIAM J. Computing, vol. 16, no. 6, pp. 973989, 1987.
[20] S. Zhang and S.A. Smolka, "Towards Efficient Parallelization of Equivalence Checking Algorithms," Proc. FORTE '92—Fifth Int'l Conf. Formal Description Techniques, pp. 133146, 1992.