메뉴 건너뛰기
Formal Aspects of Computing
Volumn 4, Issue 1 Supplement, 1992, Pages 638-648
Deciding bisimilarity is P-complete
Author keywords

Bisimilarity; CCS; Many one NC reduction; P completeness
Indexed keywords

EID: 0000128685     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/BF03180566     Document Type: Article
Times cited : (76)
References (20)
  • 1
    • 84934471993 scopus 로고    scopus 로고
    • [AHU75] Aho, A., Hopcroft, J. and Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975.
  • 2
    • 0024754676 scopus 로고
    • P-Uniform Circuit Complexity
    • (1989) J. ACM , vol.36 , Issue.4 , pp. 912-928
    • Allender, E.1
  • 3
    • 84934471992 scopus 로고    scopus 로고
    • [ABG91] Álvarez, c., Balcázar, J.L., Gabarró, J. and Sántha, M.: Parallel Complexity in the Design and Analysis of Concurrent Systems. In: Paral1el Architectures and Languages Europe PARLE’91, Lecture Notes in Computer Science 505 Springer-Verlag pp. 288–303, 1991.
  • 4
    • 84934471990 scopus 로고    scopus 로고
    • [BDG88] Balcázar, J.L., Díaz, J. and Gabarró, J.: Structural Complexity I. Springer-Verlag, 1988.
  • 5
    • 84934471988 scopus 로고    scopus 로고
    • [BDG90] Balcázar, J.L., Díaz, J. and Gabarró, J.: Structural Complexity II. Springer-Verlag, 1990.
  • 7
    • 84934471987 scopus 로고    scopus 로고
    • [GiR88] Gibbons, A. and Rytter, W.: Efficient Paral1el Algorithms. Cambridge University Press, 1988.
  • 8
    • 84934471984 scopus 로고    scopus 로고
    • [CPS89] Cleaveland, R., Parrows, J. and Steffen B.: The Concurrency Workbench. In: Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science 407, Springer-Verlag, pp. 24–37, 1989.
  • 9
    • 84934471981 scopus 로고    scopus 로고
    • [HoR84] Hoover, H.J. and Ruzzo, W.L.: A Compendium of Problems Complete for P. Manuscript, 1984.
  • 11
    • 84934471935 scopus 로고    scopus 로고
    • [KaR90] Karp, R. and Ramachandran, V.: Parallel Algorithms for Shared-Memory Machines. In: Handbook of Theoretical Computer Science, Volume A. North-Holland, pp. 869–941, 1990.
  • 12
    • 0016972709 scopus 로고
    • Formal Verification of Parallel Programs
    • (1976) C. ACM , vol.19 , Issue.7 , pp. 371-384
    • Keller, R.M.1
  • 13
    • 84934471934 scopus 로고    scopus 로고
    • [Mil80] Milner, R.: A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer-Verlag, 1980.
  • 14
    • 84934471920 scopus 로고    scopus 로고
    • [Mil89a] Milner, R.: Communication and Concurrency. Prentice Hall, 1989.
  • 16
    • 84934471918 scopus 로고    scopus 로고
    • [MSS89] Miyano, S., Shiraishi, S. and Shoudai, T.: A List of P-complete Problems. Technical Report RIFIS-TR-CS-17, Kyushu University 33, 1989.
  • 18
    • 84934471925 scopus 로고    scopus 로고
    • [Par81] Park, D.: Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science 104. Springer-Verlag pp. 168–183, 1981.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.