{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T01:10:21Z","timestamp":1737594621439,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003489"},{"type":"electronic","value":"9783540363842"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36384-x_22","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T14:21:13Z","timestamp":1196346073000},"page":"268-282","source":"Crossref","is-referenced-by-count":1,"title":["Reasoning about Layered Message Passing Systems"],"prefix":"10.1007","author":[{"given":"B.","family":"Meenakshi","sequence":"first","affiliation":[]},{"given":"R.","family":"Ramanujam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"issue":"2","key":"22_CR1","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"Alur, R., Holzmann, G. J. and Peled, D., \u201cAn analyzer for message sequence charts\u201d, Software Concepts and Tools, 17(2), 1996, 70\u201377.","journal-title":"Software Concepts and Tools"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Peled, D. and Penczek, W., \u201cModel checking of causality properties\u201d, Proc. LICS, 1995, 90\u2013100.","DOI":"10.1109\/LICS.1995.523247"},{"key":"22_CR3","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":"Alur, R. and Yannakakis, M., \u201cModel checking of message sequence charts\u201d, Proc. CONCUR 1999, Springer-Verlag LNCS 1664, 1999, 114\u2013129."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Bollig, B. and Leucker, M., \u201cModelling, specifying and verifying message passing systems\u201d, Proc. TIME 2001, 2001, 240\u2013247.","DOI":"10.1109\/TIME.2001.930723"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T. Elrad","year":"1982","unstructured":"Elrad, T. and Francez, N., \u201cDecomposition of distributed programs into communication closed layers\u201d, Science of Computer Programming, 2, 1982, 155\u2013173.","journal-title":"Science of Computer Programming"},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Compositional message sequence charts","author":"E. Gunter","year":"2001","unstructured":"Gunter, E., Muscholl, A. and Peled, D., \u201cCompositional message sequence charts\u201d, Proc. TACAS 2001, Springer-Verlag LNCS 2031, 2001, 496\u2013511."},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-44612-5_36","volume-title":"Regular collections of message sequence charts","author":"J.G. Henriksen","year":"2000","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar and Thiagarajan, P.S., \u201cRegular collections of message sequence charts\u201d, Proc. MFCS 2000, Springer-Verlag LNCS 1893, 2000, 405\u2013414."},{"issue":"7","key":"22_CR8","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L., \u201cTime, clocks and ordering of events in a distributed system\u201d, Communications of ACM 21(7), 1978, 558\u2013565.","journal-title":"Communications of ACM"},{"key":"22_CR9","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":"Madhusudan, P., \u201cReasoning about sequential and branching behaviours of message sequence graphs\u201d, Proc. ICALP 2001, Springer-Verlag LNCS 2076, 2001, 396\u2013407."},{"key":"22_CR10","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":"Madhusudan, P. and Meenakshi, B., \u201cBeyond message sequence graphs\u201d, Proc. FST & TCS 2001, Springer-Verlag LNCS 2245, 2001, 256\u2013267."},{"key":"22_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/3-540-45022-X_41","volume-title":"Reasoning about message passing in finite state environments","author":"B. Meenakshi","year":"2000","unstructured":"Meenakshi, B. and Ramanujam, R., \u201cReasoning about message passing in finite state environments\u201d, Proc. ICALP 2000, LNCS 1853, 2000, 487\u2013498."},{"key":"22_CR12","unstructured":"Meenakshi, B. and Ramanujam, R., \u201cReasoning about layered message passing systems\u201d, full version, http:\/\/www.imsc.res.in\/~bmeena ."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Peled, D., \u201cSpecification and verification of message sequence charts\u201d, In Proc. IFIP FORTE\/PSTV, 2000, 139\u2013154.","DOI":"10.1007\/978-0-387-35533-7_9"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Poel, M. and Zwiers, J., \u201cLayering techniques for development of parallel systems\u201d, Proc. CAV, 1992, 16\u201329.","DOI":"10.1007\/3-540-56496-9_3"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Ramanujam, R., \u201cLocally linear time temporal logic\u201d, Proc. LICS, 1996, 118\u2013127.","DOI":"10.1109\/LICS.1996.561311"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/0169-7552(95)00122-0","volume":"28","author":"E. Rudolph","year":"1996","unstructured":"Rudolph, E., Graubmann, P. and Grabowski, J., \u201cTutorial on message sequence charts\u201d, Computer Networks and ISDN Systems-SDL and MSC, Vol. 28, 1996, 1629\u20131641.","journal-title":"Computer Networks and ISDN Systems-SDL and MSC"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Thiagarajan, P.S., \u201cA trace based extension of propositional linear time temporal logic\u201d, Proc. LICS, 1994, 438\u2013447.","DOI":"10.1109\/LICS.1994.316047"},{"key":"22_CR18","unstructured":"ITU-TS Recommendation Z.120-Message sequence chart, ITU-TS, 1997."}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36384-X_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:57:54Z","timestamp":1737593874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36384-X_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,16]]},"ISBN":["9783540003489","9783540363842"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-36384-x_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002,12,16]]}}}