메뉴 건너뛰기




Volumn 89, Issue 1, 2003, Pages 99-113

Distributed branching bisimulation reduction of state spaces

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; CODES (SYMBOLS); COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; COMPUTER TESTING; COMPUTER WORKSTATIONS; STORAGE ALLOCATION (COMPUTER);

EID: 13844317980     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80099-4     Document Type: Conference Paper
Times cited : (47)

References (17)
  • 3
    • 0141977628 scopus 로고    scopus 로고
    • A distributed algorithm for strong bisimulation reduction of state spaces
    • L. Brim, & O. Grumberg.
    • Blom S., Orzan S. A distributed algorithm for strong bisimulation reduction of state spaces. Brim L., Grumberg O. Proceedings of PDMC'02, ENTCS 68. 2002
    • (2002) Proceedings of PDMC'02, ENTCS 68
    • Blom, S.1    Orzan, S.2
  • 4
    • 18944377208 scopus 로고    scopus 로고
    • Distributed state space minimization
    • F. Aagesen, T. Arts, & W. Fokkink. to appear
    • Blom S., Orzan S. Distributed state space minimization. Aagesen F., Arts T., Fokkink W. Proceedings of FMICS'03, ENTCS 80. 2003;. to appear
    • (2003) Proceedings of FMICS'03, ENTCS 80
    • Blom, S.1    Orzan, S.2
  • 6
    • 0024035719 scopus 로고
    • Characterizing finite Kripke structures in propositional temporal logic
    • Browne M., Clarke E., Grumberg O. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science 59. 1988;115-131
    • (1988) Theoretical Computer Science 59 , pp. 115-131
    • Browne, M.1    Clarke, E.2    Grumberg, O.3
  • 7
    • 84957379824 scopus 로고    scopus 로고
    • CADP a protocol validation and verification toolbox
    • Proceedings of the 8th International Conference on Computer Aided Verification (CAV'96)
    • Fernandez, J.-C., H. Garavel, A. Kerbrat, L. Mounier, R. Mateescu and M. Sighireanu, CADP a protocol validation and verification toolbox, in: Proceedings of the 8th International Conference on Computer Aided Verification (CAV'96), LNCS 1102 (1996), pp. 437-440.
    • (1996) LNCS , vol.1102 , pp. 437-440
    • Fernandez, J.-C.1    Garavel, H.2    Kerbrat, A.3    Mounier, L.4    Mateescu, R.5    Sighireanu, M.6
  • 10
    • 54249140950 scopus 로고
    • An efficient algorithm for branching bisimulation and stuttering equivalence
    • M.S. Paterson.
    • Groote J., Vaandrager F. An efficient algorithm for branching bisimulation and stuttering equivalence. Paterson M.S. roceedings of the 17th ICALP, LNCS 443. 1990;626-638
    • (1990) Roceedings of the 17th ICALP, LNCS 443 , pp. 626-638
    • Groote, J.1    Vaandrager, F.2
  • 12
    • 18944377894 scopus 로고    scopus 로고
    • XTL: A meta-language and tool for temporal logic model-checking
    • T. Margaria and B. Steffen, editors, Proceedings of the International Workshop on Software Tools for Technology Transfer (STTT'98)
    • Mateescu, R. and H. Garavel, XTL: A meta-language and tool for temporal logic model-checking, in: T. Margaria and B. Steffen, editors, Proceedings of the International Workshop on Software Tools for Technology Transfer (STTT'98), number NS-98-4 in BRICS Notes Series, 1998.
    • (1998) BRICS Notes Series , vol.NS-98-4
    • Mateescu, R.1    Garavel, H.2
  • 16
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • Tarjan R. Depth-first search and linear graph algorithms. SIAM Journal of Computing 1. 1972;146-160
    • (1972) SIAM Journal of Computing 1 , pp. 146-160
    • Tarjan, R.1
  • 17
    • 0030143334 scopus 로고    scopus 로고
    • Branching time and abstraction in bisimulation semantics
    • van Glabbeek R., Weijland W. Branching time and abstraction in bisimulation semantics. Journal of the ACM. 43:(3):1996;555-600
    • (1996) Journal of the ACM , vol.43 , Issue.3 , pp. 555-600
    • Van Glabbeek, R.1    Weijland, W.2


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