메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 3731 LNCS, Issue , 2005, Pages 53-67
A hierarchy of implement able MSC languages
Author keywords

[No Author keywords available]
Indexed keywords

AUTOMATA THEORY; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; HIERARCHICAL SYSTEMS; MESSAGE PASSING;
EID: 33646390937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11562436_6     Document Type: Conference Paper
Times cited : (5)
References (11)
  • 2
    • 26844516655 scopus 로고    scopus 로고
    • Message-passing automata are expressively equivalent to EMSO logic
    • [BL04]. Proceedings of CONCUR 2004, Springer
    • [BL04] B. Bollig and M. Leucker. Message-Passing Automata are expressively equivalent to EMSO Logic. In Proceedings of CONCUR 2004, volume 3170 of LNCS. Springer, 2004.
    • (2004) LNCS , vol.3170
    • Bollig, B.1    Leucker, M.2
  • 3
    • 35048904112 scopus 로고    scopus 로고
    • A Kleene theorem for a class of communicating automata with effective algorithms
    • [GMK04]. Proceedings of DLT 2004, Springer
    • [GMK04] B. Genest, A. Muscholl, and D. Kuske. A Kleene theorem for a class of communicating automata with effective algorithms. In Proceedings of DLT 2004, volume 3340 of LNCS. Springer, 2004.
    • (2004) LNCS , vol.3340
    • Genest, B.1    Muscholl, A.2    Kuske, D.3
  • 4
    • 84869187985 scopus 로고    scopus 로고
    • Infinite-state high-level MSCs: Model-checking and readability
    • [GMSZ02]. Proceedings of ICALP 2002, Springer
    • [GMSZ02] B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun. Infinite-state high-level MSCs: Model-checking and readability. In Proceedings of ICALP 2002, volume 2380 of LNCS. Springer, 2002.
    • (2002) LNCS , vol.2380
    • Genest, B.1    Muscholl, A.2    Seidl, H.3    Zeitoun, M.4
  • 6
    • 84959181355 scopus 로고    scopus 로고
    • Regular collections of message sequence charts
    • [HMKT00]. Proceedings of MFCS 2000, Springer
    • [HMKT00] J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. S. Thiagarajan. Regular collections of message sequence charts. In Proceedings of MFCS 2000, volume 1893 of LNCS. Springer, 2000.
    • (2000) LNCS , vol.1893
    • Henriksen, J.G.1    Mukund, M.2    Narayan Kumar, K.3    Thiagarajan, P.S.4
  • 7
    • 0004144738 scopus 로고    scopus 로고
    • [ITU99] ITU-TS Recommendation Z.120: MSC99
    • [ITU99] ITU-TS Recommendation Z.120: Message Sequence Chart 1999 (MSC99), 1999.
    • (1999) Message Sequence Chart , vol.1999
  • 8
    • 84937410276 scopus 로고    scopus 로고
    • A further step towards a theory of regular MSC languages
    • [Kus02]. Proceedings of STAGS 2002, Springer
    • [Kus02] D. Kuske. A further step towards a theory of regular MSC languages. In Proceedings of STAGS 2002, volume 2285 of LNCS. Springer, 2002.
    • (2002) LNCS , vol.2285
    • Kuske, D.1
  • 9
    • 0344981321 scopus 로고    scopus 로고
    • Regular sets of infinite message sequence charts
    • [Kus03]
    • [Kus03] D. Kuske. Regular Sets of Infinite Message Sequence Charts. Information and Computation, 187:80-109, 2003.
    • (2003) Information and Computation , vol.187 , pp. 80-109
    • Kuske, D.1
  • 10
    • 84937403715 scopus 로고    scopus 로고
    • Recognizable sets of message sequence charts
    • [Mor02]. Proceedings of STAGS 2002, Springer
    • [Mor02] R. Morin. Recognizable sets of message sequence charts. In Proceedings of STAGS 2002, volume 2285 of LNCS. Springer, 2002.
    • (2002) LNCS , vol.2285
    • Morin, R.1
  • 11
    • 84947757858 scopus 로고
    • A trace consistent subset of PTL
    • [Thi95]. Proceedings of CONCUR 1995, Springer
    • [Thi95] P. S. Thiagarajan. A trace consistent subset of PTL. In Proceedings of CONCUR 1995, volume 962 of LNCS. Springer, 1995.
    • (1995) LNCS , vol.962
    • Thiagarajan, P.S.1

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