{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T03:59:28Z","timestamp":1791086368724,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540742395","type":"print"},{"value":"9783540742401","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_8","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T11:04:18Z","timestamp":1188212658000},"page":"76-87","source":"Crossref","is-referenced-by-count":8,"title":["Local Testing of Message Sequence Charts Is Difficult"],"prefix":"10.1007","author":[{"given":"Puneet","family":"Bhateja","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Gastin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Madhavan","family":"Mukund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K. Narayan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"CONCUR\u201999. Concurrency Theory","author":"R. Alur","year":"1999","unstructured":"Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 114\u2013129. Springer, Heidelberg (1999)"},{"issue":"7","key":"8_CR2","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/TSE.2003.1214326","volume":"29","author":"R. Alur","year":"2003","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence graphs. IEEE Trans. Software Engg.\u00a029(7), 623\u2013633 (2003)","journal-title":"IEEE Trans. Software Engg."},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2004.09.034","volume":"331","author":"R. Alur","year":"2005","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Realizability and Verification of MSC Graphs. Theor. Comput. Sci.\u00a0331(1), 97\u2013114 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR4","volume-title":"Unified Modeling Language User Guide","author":"G. Booch","year":"1997","unstructured":"Booch, G., Jacobson, I., Rumbaugh, J.: Unified Modeling Language User Guide. Addison-Wesley, London, UK (1997)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.08.004","volume":"202","author":"J.G. Henriksen","year":"2005","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. Inf. Comp.\u00a0202(1), 1\u201338 (2005)","journal-title":"Inf. Comp."},{"key":"8_CR6","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, London, UK (1979)"},{"key":"8_CR7","unstructured":"ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (1997)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of Reachability in Vector Addition Systems. In: Proc 14th ACM STOC, 267\u2013281 (1982)","DOI":"10.1145\/800070.802201"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput"},{"key":"8_CR10","first-page":"291","volume-title":"Proc SDL 1997","author":"S. Mauw","year":"1997","unstructured":"Mauw, S., Reniers, M.A.: High-level message sequence charts. In: Proc SDL 1997, pp. 291\u2013306. Elsevier, Amsterdam (1997)"},{"key":"8_CR11","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, pp. 523\u2013534. Springer, Heidelberg (2002)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"Mathematical Foundations of Computer Science 1999","author":"A. Muscholl","year":"1999","unstructured":"Muscholl, A., Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 81\u201391. Springer, Heidelberg (1999)"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(95)00187-5","volume":"57","author":"A. Muscholl","year":"1996","unstructured":"Muscholl, A., Peterson, H.: A note on the commutative closure of star-free languages. Information Processing Letters\u00a057(2), 71\u201374 (1996)","journal-title":"Information Processing Letters"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Lectures on Petri Nets I: Basic Models, Advances in Petri Nets","year":"1998","unstructured":"Reisig, W., Rozenberg, G. (eds.): Lectures on Petri Nets I: Basic Models, Advances in Petri Nets. LNCS, vol.\u00a01491. Springer, Heidelberg (1998)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Rudolph, E., Graubmann, P., Grabowski, J.: Tutorial on message sequence charts. Computer Networks and ISDN Systems \u2014 SDL and MSC\u00a028 (1996)","DOI":"10.1016\/0169-7552(95)00122-0"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-60218-6_33","volume-title":"CONCUR \u201995 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, pp. 438\u2013452. Springer, Heidelberg (1995)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/978-3-540-27793-4_24","volume-title":"Applications and Theory of Petri Nets 2004","author":"H. Wimmel","year":"2004","unstructured":"Wimmel, H.: Infinity of Intermediate States Is Decidable for Petri Nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol.\u00a03099, pp. 426\u2013434. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:15:30Z","timestamp":1619518530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}