메뉴 건너뛰기




Volumn 1102, Issue , 1996, Pages 38-49

A partition refinement algorithm for the π-calculus

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84957635777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61474-5_56     Document Type: Conference Paper
Times cited : (9)

References (12)
  • 3
    • 0013406979 scopus 로고
    • On the decidability of process equivalences for the π-calculus
    • RR:94-20
    • M. Dam. On the decidability of process equivalences for the π-calculus. SICS Research Report RR:94-20, 1994.
    • (1994) SICS Research Report
    • Dam, M.1
  • 4
    • 84957615304 scopus 로고
    • On-the-fly" verification of behavioural equivalences and preorders
    • Springer Verlag
    • J.-C. Fernandez and L. Mounier. "On-the-fly" verification of behavioural equivalences and preorders. In Proc. CAV'91, LNCS 575. Springer Verlag, 1994.
    • (1994) Proc. CAV'91, LNCS 575
    • Fernandez, J.-C.1    Mounier, L.2
  • 5
    • 0001128385 scopus 로고
    • Deciding bisimulation equivalences for a class of nonfinite- state programs
    • B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of nonfinite- state programs. Information and Computation, 107:272-302, 1993.
    • (1993) Information and Computation , vol.107 , pp. 272-302
    • Jonsson, B.1    Parrow, J.2
  • 6
    • 0025432462 scopus 로고
    • CCS expressions, finite state processes, and three problems of equivalence
    • P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
    • (1990) Information and Computation , vol.86 , pp. 43-68
    • Kanellakis, P.C.1    Smolka, S.A.2
  • 8
    • 84947713182 scopus 로고
    • Checking bisimilarity for finitary π-calculus
    • Springer Verlag
    • U. Montanari and M. Pistore. Checking bisimilarity for finitary π-calculus. In Proc. CONCUR'95, LNCS 962. Springer Verlag, 1995.
    • (1995) Proc. CONCUR'95, LNCS 962
    • Montanari, U.1    Pistore, M.2
  • 9
    • 0000335030 scopus 로고
    • An algebraic verification of a mobile network
    • F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, 4:497-543, 1992.
    • (1992) Formal Aspects of Computing , vol.4 , pp. 497-543
    • Orava, F.1    Parrow, J.2
  • 10
    • 0023566630 scopus 로고
    • Three partition refinement algorithms
    • R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
    • (1987) SIAM Journal on Computing , vol.16 , Issue.6 , pp. 973-989
    • Paige, R.1    Tarjan, R.E.2
  • 11
    • 0346704528 scopus 로고
    • A theory of bisimulation for π-calculus
    • Springer Verlag
    • D. Sangiorgi. A theory of bisimulation for π-calculus. In Proc. CONCUR '93, LNCS 715. Springer Verlag, 1993.
    • (1993) Proc. CONCUR '93, LNCS 715
    • Sangiorgi, D.1
  • 12
    • 0001223167 scopus 로고
    • The Mobility Workbench - A tool for the r-calculus
    • Springer Verlag
    • B. Victor and F. Moiler. The Mobility Workbench - A tool for the r-calculus. In Proc. CAV'94, LNCS 818. Springer Verlag, 1994
    • (1994) Proc. CAV'94, LNCS 818
    • Victor, B.1    Moiler, F.2


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