{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:27Z","timestamp":1725493527577},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_59","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"720-731","source":"Crossref","is-referenced-by-count":7,"title":["From Finite State Communication Protocols to High-Level Message Sequence Charts"],"prefix":"10.1007","author":[{"given":"Anca","family":"Muscholl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"59_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-63166-6_34","volume-title":"Proc. of CAV\u201997","author":"R. Alur","year":"1997","unstructured":"R. Alur, R. K. Brayton, T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Partial order reduction in symbolic state space exploration. In Proc. of CAV\u201997, LNCS 1254, pp. 340\u2013351, 1997."},{"key":"59_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CONCUR\u201999","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. of CONCUR\u201999, LNCS 1664, 1999."},{"key":"59_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Proc. of TACAS\u20192001","author":"E. Gunter","year":"2001","unstructured":"E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In Proc. of TACAS\u20192001, LNCS 2031, pp. 496\u2013511, 2001."},{"key":"59_CR4","unstructured":"L. H\u00e9lou\u0451t and P. Le Maigat. Decomposition of Message Sequence Charts. In Proc. of the 2nd Workshop on SDL and MSC (SAM\u20192000), pages 46\u201360, 2000."},{"key":"59_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Proc. of ICALP\u20192000","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 Proc. of ICALP\u20192000, LNCS 1853, pages 675\u2013686, 2000."},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"A. Muscholl. \u00dcber die Erkennbarkeit unendlicher Spuren. Teubner, 1996.","DOI":"10.1007\/978-3-322-95371-1"},{"key":"59_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"Proc. of MFCS\u201999","author":"A. Muscholl","year":"1999","unstructured":"A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In Proc. of MFCS\u201999, LNCS 1672, pp. 81\u201391, 1999."},{"issue":"2","key":"59_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(97)00219-3","volume":"195","author":"D. A. Peled","year":"1998","unstructured":"D. A. Peled, T. Wilke, and P. Wolper. An algorithmic approach for checking closure properties of temporal logic specifications and omega-regular languages. Theoretical Computer Science, 195(2):183\u2013203, 1998.","journal-title":"Theoretical Computer Science"}],"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-48224-5_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:27:53Z","timestamp":1556922473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_59","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}