{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T02:51:28Z","timestamp":1783392688014,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540643005","type":"print"},{"value":"9783540697206","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053553","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:19:46Z","timestamp":1149643186000},"page":"226-242","source":"Crossref","is-referenced-by-count":69,"title":["Deciding properties for message sequence charts"],"prefix":"10.1007","author":[{"given":"Anca","family":"Muscholl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhendong","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"issue":"2","key":"16_CR1","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"R. Alur, G. Holzmann, and D. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70\u201377, 1996.","journal-title":"Software Concepts and Tools"},{"key":"16_CR2","first-page":"259","volume-title":"number 1217 in Lecture Notes in Computer Science","author":"H. Ben-Abdallah","year":"1997","unstructured":"H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in message sequence charts. In E. Brinksma, editor, Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, Third International Workshop, TACAS'97, number 1217 in Lecture Notes in Computer Science, pages 259\u2013274, Enschede, The Netherlands, 1997. Springer."},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"J. Berstel. Transductions and context-free languages. Teubner Studienb\u00fccher, Stuttgart, 1979."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(84)90053-7","volume":"34","author":"M. Clerbout","year":"1984","unstructured":"M. Clerbout and M. Latteux. Partial commutations and faithful rational transductions. Theoretical Computer Science, 34:241\u2013254, 1984.","journal-title":"Theoretical Computer Science"},{"key":"16_CR5","volume-title":"The Book of Traces","year":"1995","unstructured":"V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995."},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1137\/0406035","volume":"6","author":"J. Feigenbaum","year":"1993","unstructured":"J. Feigenbaum, J. Kahn, and C. Lund. Complexity results for pomset languages. SIAM Journal Disc. Math., 6(3):432\u2013442, 1993.","journal-title":"SIAM Journal Disc. Math."},{"key":"16_CR7","unstructured":"ITU-T Recommendation Z.120, Message Sequence Chart (MSC), March 1993."},{"key":"16_CR8","first-page":"652","volume-title":"volume 1214 of Lecture Notes in Computer Science","author":"V. Levin","year":"1997","unstructured":"V. Levin and D. Peled. Verification of message sequence charts via template matching. In TAPSOFT (FASE)'97, Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 652\u2013666, Lille, France, 1997. Springer."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures and domains, part 1. Theoretical Computer Science, 13:85\u2013108, 1981.","journal-title":"Theoretical Computer Science"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of Formal Languages, volume 1","author":"J.-E. Pin","year":"1997","unstructured":"J.-E. Pin. Syntactic semigroups. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, pages 679\u2013738. Springer, Berlin-Heidelberg-New York, 1997."},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. R. Pratt","year":"1986","unstructured":"V. R. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33\u201371, 1986.","journal-title":"International Journal of Parallel Programming"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T17:22:42Z","timestamp":1549819362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643005","9783540697206"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0053553","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}