{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:41Z","timestamp":1725484661219},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_31","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T22:33:34Z","timestamp":1180478014000},"page":"326-340","source":"Crossref","is-referenced-by-count":10,"title":["Pattern Matching and Membership for Hierarchical Message Sequence Charts"],"prefix":"10.1007","author":[{"given":"Blaise","family":"Genest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"31_CR1","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, pp. 797\u2013808, 2001."},{"issue":"2","key":"31_CR2","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":"31_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-48523-6_14","volume-title":"ICALP\u201999","author":"R. Alur","year":"1999","unstructured":"R. Alur, S. Kannan, and M. Yannakakis. Communicating hierarchical state machines. In ICALP\u201999, LNCS 1644, pp. 169\u2013178, 1999."},{"issue":"6","key":"31_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/291252.288305","volume":"23","author":"Rajeev Alur","year":"1998","unstructured":"R. Alur and M. Yannakakis. Model checking of hierarchical state machines. In SIGSOFT\u2019 98, pp. 175\u2013188, 1998.","journal-title":"ACM SIGSOFT Software Engineering Notes"},{"key":"31_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","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, pp. 114\u2013129, 1999."},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N. J. Fine","year":"1965","unstructured":"N.J. Fine and H.S. Wilf. Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society, 16, 1965.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"31_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"TACAS\u201901","author":"E. Gunter","year":"2001","unstructured":"E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In TACAS\u201901, LNCS 2031, pp. 496\u2013511, 2001."},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel. Statecharts: A visual formulation for complex systems. Science of Computer Programming, 8(3):231\u2013274, 1987.","journal-title":"Science of Computer Programming"},{"key":"31_CR9","series-title":"Lect Notes Comput Sci","first-page":"258","volume-title":"CONCUR\u2019 97","author":"M. Y. Vardi","year":"1997","unstructured":"M. Y. Vardi, D. Harel, O. Kupferman. On the complexity of verifying concurrent transition systems. In CONCUR\u2019 97, LNCS 1243, pp. 258\u2013272, 1997."},{"key":"31_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/3-540-48224-5_66","volume-title":"ICALP\u201901","author":"P. Madhusudan","year":"2001","unstructured":"P. Madhusudan. Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs. In ICALP\u201901, LNCS 2076, pp. 809\u2013820, 2001."},{"key":"31_CR11","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, pp. 81\u201391, 1999."},{"key":"31_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"FoSSaCS\u201998","author":"A. Muscholl","year":"1998","unstructured":"A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In FoSSaCS\u201998, LNCS 1378, pp. 226\u2013242, 1998."},{"key":"31_CR13","series-title":"Lect Notes Comput Sci","volume-title":"CPM\u2019 97","author":"M. Miyazaki","year":"1997","unstructured":"M. Miyazaki, A. Shinohara, and M. Takeda. An improved pattern matching algorithm for strings in terms of straight-line programs. In CPM\u2019 97, LNCS 1264."},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms \u2014 ESA '94","author":"Wojciech Plandowski","year":"1994","unstructured":"W. Plandowski. Testing equivalence of morphisms on context-free languages. In ESA\u2019 94, pp. 460\u2013470, 1994."},{"key":"31_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/3-540-47849-3_3","volume-title":"SOFSEM\u2019 99","author":"W. Rytter","year":"1999","unstructured":"W. Rytter. Algorithms on compressed strings and arrays. In SOFSEM\u2019 99, LNCS 1725, pp. 48\u201365, 1999."},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"T. J. Schaefer. The complexity of satisfiability problems. In STOC\u2019 78, pp. 216\u2013226, 1978.","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T19:19:28Z","timestamp":1550344768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}