{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:27:07Z","timestamp":1742952427352,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291893"},{"type":"electronic","value":"9783540320845"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11562436_6","type":"book-chapter","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T09:40:51Z","timestamp":1129714851000},"page":"53-67","source":"Crossref","is-referenced-by-count":4,"title":["A Hierarchy of Implementable MSC Languages"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Inference of Message Sequence Charts. In: Proceedings of the 22nd International Conference on Software Engineering. ACM Press, New York (2000)","DOI":"10.1145\/337180.337215"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-28644-8_10","volume-title":"CONCUR 2004 - Concurrency Theory","author":"B. Bollig","year":"2004","unstructured":"Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 146\u2013160. Springer, Heidelberg (2004)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-30550-7_4","volume-title":"Developments in Language Theory","author":"B. Genest","year":"2004","unstructured":"Genest, B., Muscholl, A., Kuske, D.: A kleene theorem for a class of communicating automata with effective algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 30\u201348. Springer, Heidelberg (2004)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/3-540-45465-9_56","volume-title":"Automata, Languages and Programming","author":"B. Genest","year":"2002","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level mSCs: Model-checking and realizability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 657. Springer, Heidelberg (2002)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. Information and Computation (2004) (to appear)","DOI":"10.1016\/j.ic.2004.08.004"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-44612-5_36","volume-title":"Mathematical Foundations of Computer Science 2000","author":"J.G. Henriksen","year":"2000","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Regular collections of message sequence charts. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, p. 405. Springer, Heidelberg (2000)"},{"key":"6_CR7","unstructured":"ITU-TS Recommendation Z.120: Message Sequence Chart 1999, MSC 1999 (1999)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/3-540-45841-7_40","volume-title":"STACS 2002","author":"D. Kuske","year":"2002","unstructured":"Kuske, D.: A further step towards a theory of regular MSC languages. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, p. 489. Springer, Heidelberg (2002)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0890-5401(03)00123-8","volume":"187","author":"D. Kuske","year":"2003","unstructured":"Kuske, D.: Regular Sets of Infinite Message Sequence Charts. Information and Computation\u00a0187, 80\u2013109 (2003)","journal-title":"Information and Computation"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-45841-7_43","volume-title":"STACS 2002","author":"R. Morin","year":"2002","unstructured":"Morin, R.: Recognizable sets of message sequence charts. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, p. 523. Springer, Heidelberg (2002)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60692-0","volume-title":"CONCUR 1995 Concurrency Theory","author":"P.S. Thiagarajan","year":"1995","unstructured":"Thiagarajan, P.S.: A trace consistent subset of PTL. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Systems - FORTE 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11562436_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T10:40:21Z","timestamp":1586515221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11562436_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291893","9783540320845"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11562436_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}