{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:30Z","timestamp":1725489150927},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002253"},{"type":"electronic","value":"9783540362067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36206-1_23","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:23:08Z","timestamp":1187248988000},"page":"253-264","source":"Crossref","is-referenced-by-count":10,"title":["Dynamic Message Sequence Charts"],"prefix":"10.1007","author":[{"given":"Martin","family":"Leucker","sequence":"first","affiliation":[]},{"given":"P.","family":"Madhusudan","sequence":"additional","affiliation":[]},{"given":"Supratik","family":"Mukhopadhyay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"23_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"Model checking of message sequence charts","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. 10th Int\u2019l. Conf. on Concurrency Theory, LNCS 1664, p. 114\u2013129. Springer, 1999."},{"key":"23_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-61440-0_128","volume-title":"On infinite transition graphs having a decidable monadic theory","author":"D. Caucal","year":"1996","unstructured":"D. Caucal. On infinite transition graphs having a decidable monadic theory. In Proc. the 23th International Colloquium on Automata, Languages and Programming (ICALP\u201996), LNCS 1099, p. 194\u2013205, Springer, 1996."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"B. Courcelle. On the expression of graph properties in some fragments of monadic second-order logic. In Descriptive complexity and finite models, volume 31. DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences, June 1997.","DOI":"10.1090\/dimacs\/031\/02"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"M. Leucker, P. Madhusudan, and S. Mukhopadhyay. Dynamic message sequence charts. Technical Report MS-CIS-02-27, University of Pennsylvania, 2002.","DOI":"10.1007\/3-540-36206-1_23"},{"key":"23_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/3-540-48224-5_33","volume-title":"Reasoning about sequential and branching behaviours of message sequence graphs","author":"P. Madhusudan","year":"2001","unstructured":"P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP\u201901), LNCS 2076, p. 396\u2013407. Springer, 2001."},{"key":"23_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-45294-X_22","volume-title":"Beyond message sequence graphs","author":"P. Madhusudan","year":"2001","unstructured":"P. Madhusudan and B. Meenakshi. Beyond message sequence graphs. In Proc. 21st Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 2245, p. 256\u2013267. Springer, 2001."},{"key":"23_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus for Communicating Processes","author":"R. Milner","year":"1980","unstructured":"R. Milner. A Calculus for Communicating Processes, LNCS 92, Springer, 1980."},{"key":"23_CR8","unstructured":"ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart 1996 (MSC96). Technical report, ITU-TS, Geneva, 1996."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"W. Thomas. Languages, automata and logic. In Handbook of Formal Languages, volume 3, Beyond Words. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_7"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36206-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T21:45:50Z","timestamp":1629582350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36206-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002253","9783540362067"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-36206-1_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}