{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:37:50Z","timestamp":1757450270104},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438649"},{"type":"electronic","value":"9783540454656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_56","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T21:12:57Z","timestamp":1180213977000},"page":"657-668","source":"Crossref","is-referenced-by-count":20,"title":["Infinite-State High-Level MSCs: Model-Checking and Realizability"],"prefix":"10.1007","author":[{"given":"Blaise","family":"Genest","sequence":"first","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Zeitoun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"key":"56_CR1","unstructured":"ITU-TS recommendation Z.120, 1996."},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In 22nd Int. Conf. on Software Engineering, pages 304\u2013313. ACM, 2000.","DOI":"10.1145\/337180.337215"},{"key":"56_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1007\/3-540-48224-5_65","volume-title":"ICALP\u201901","author":"R. Alur","year":"2001","unstructured":"R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. In ICALP\u201901, LNCS 2076, pages 797\u2013808, 2001."},{"issue":"2","key":"56_CR4","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"R. Alur, G. H. Holzmann, and D. A. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70\u201377, 1996.","journal-title":"Software Concepts and Tools"},{"key":"56_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"CONCUR\u201999","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In CONCUR\u201999, LNCS 1664, pages 114\u2013129, 1999."},{"issue":"2","key":"56_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323\u2013342, 1983.","journal-title":"Journal of the ACM"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"B. Caillaud, P. Darondeau, L. H\u00e9lou\u00ebt, and G. Lesventes. HMSCs as partial specifications... with PNs as completions. In MOVEP, 2000.","DOI":"10.1007\/3-540-45510-8_5"},{"key":"56_CR8","unstructured":"L. H\u00e9lou\u00ebt and C. Jard. Conditions for synthesis of communicating automata from HMSCs. In 5th Int. Workshop on Formal Methods for Ind. Crit. Systems, 2000."},{"key":"56_CR9","unstructured":"L. H\u00e9lou\u00ebt and P. Le Maigat. Decomposition of Message Sequence Charts. In SAM2000, pages 46\u201360, 2000."},{"key":"56_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"ICALP\u201900","author":"J. G. Henriksen","year":"2000","unstructured":"J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. Thiagarajan. On message sequence graphs and finitely generated regular msc languages. In ICALP\u201900, LNCS 1853, pages 675\u2013686, 2000."},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(88)90027-8","volume":"58","author":"Y. M\u00e9tivier","year":"1988","unstructured":"Y. M\u00e9tivier. On recognizable subsets of free partially commutative monoids. Theoretical Computer Science, 58:201\u2013208, 1988.","journal-title":"Theoretical Computer Science"},{"key":"56_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/3-540-45841-7_43","volume-title":"STACS\u201902","author":"R. Morin","year":"2002","unstructured":"R. Morin. Recognizable Sets of Message Sequence Charts. In STACS\u201902, LNCS 2285, pages 523\u2013534, 2002."},{"key":"56_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/3-540-44618-4_37","volume-title":"CONCUR\u201900","author":"M. Mukund","year":"2000","unstructured":"M. Mukund, K. Narayan Kumar, and M. Sohoni. Synthesizing distributed finite-state systems from MSCs. In CONCUR\u201900, LNCS 1877, pages 521\u2013535, 2000."},{"key":"56_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"MFCS\u201999","author":"A. Muscholl","year":"1999","unstructured":"A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In MFCS\u201999, LNCS 1672, pages 81\u201391, 1999."},{"key":"56_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1142\/9789814261456_0006","volume-title":"The Book of Traces","author":"E. Ochma\u0144ski","year":"1995","unstructured":"E. Ochma\u0144ski. Recognizable trace languages. In The Book of Traces, chapter 6, pages 167\u2013204. World Scientific, Singapore, 1995."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45465-9_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T07:05:56Z","timestamp":1556435156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_56","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}