{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:34:36Z","timestamp":1725568476565},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642165573"},{"type":"electronic","value":"9783642165580"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16558-0_45","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T13:36:49Z","timestamp":1288705009000},"page":"549-563","source":"Crossref","is-referenced-by-count":7,"title":["Analysing Message Sequence Graph Specifications"],"prefix":"10.1007","author":[{"given":"Joy","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"D\u2019Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Narayan Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"45_CR1","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 charts. IEEE Trans. Software Eng.\u00a029(7), 623\u2013633 (2003)","journal-title":"IEEE Trans. Software Eng."},{"key":"45_CR2","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)"},{"key":"45_CR3","unstructured":"Chakraborty, J., D\u2019Souza, D., Narayan Kumar, K.: Analysing Message Sequence Graph Specifications, Technical Report IISc-CSA-TR-2009-1, CSA Department, IISc (2009), http:\/\/www.csa.iisc.ernet.in\/TR\/2009\/1\/"},{"issue":"1","key":"45_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0890-5401(87)90040-X","volume":"73","author":"M. Clerbout","year":"1987","unstructured":"Clerbout, M., Latteux, M.: Semi-commutations. Inf. Comput.\u00a073(1), 59\u201374 (1987)","journal-title":"Inf. Comput."},{"key":"45_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-540-27755-2_15","volume-title":"Lectures on Concurrency and Petri Nets","author":"B. Genest","year":"2004","unstructured":"Genest, B., Muscholl, A., Peled, D.: Message sequence charts. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.\u00a03098, pp. 537\u2013558. Springer, Heidelberg (2004)"},{"issue":"1","key":"45_CR6","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., Kumar, K.N., Sohoni, M.A., Thiagarajan, P.S.: A theory of regular msc languages. Inf. Comput.\u00a0202(1), 1\u201338 (2005)","journal-title":"Inf. Comput."},{"key":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-36578-8_26","volume-title":"Fundamental Approaches to Software Engineering","author":"H. Muccini","year":"2003","unstructured":"Muccini, H.: Detecting implied scenarios analyzing non-local branching choices. In: Pezz\u00e9, M. (ed.) FASE 2003. LNCS, vol.\u00a02621, pp. 372\u2013386. Springer, Heidelberg (2003)"},{"key":"45_CR8","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":"45_CR9","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., Petersen, H.: A note on the commutative closure of star-free languages. Inf. Process. Lett.\u00a057(2), 71\u201374 (1996)","journal-title":"Inf. Process. Lett."},{"key":"45_CR10","unstructured":"Uchitel, S.: LTSA-MSC tool (2001), http:\/\/www.doc.ic.ac.uk\/~su2\/Synthesis\/"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Uchitel, S.: Incremental Elaboration of Scenario Based Specifications and Behavior Models Using Implied Scenarios. PhD thesis, Imperial College (2003)","DOI":"10.1145\/1005561.1005563"},{"key":"45_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-36577-X_44","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Uchitel","year":"2003","unstructured":"Uchitel, S., Chatley, R., Kramer, J., Magee, J.: LTSA-MSC: Tool support for behaviour model elaboration using implied scenarios. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 597\u2013601. Springer, Heidelberg (2003)"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Uchitel, S., Kramer, J., Magee, J.: Detecting implied scenarios in message sequence chart specifications. In: ESEC \/ SIGSOFT FSE, pp. 74\u201382 (2001)","DOI":"10.1145\/503209.503220"},{"issue":"1","key":"45_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1005561.1005563","volume":"13","author":"S. Uchitel","year":"2004","unstructured":"Uchitel, S., Kramer, J., Magee, J.: Incremental Elaboration of Scenario-Based Specifications and Behavior Models Using Implied Scenarios. ACM Transactions on Software Engineering and Methodology\u00a013(1), 37\u201385 (2004)","journal-title":"ACM Transactions on Software Engineering and Methodology"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification, and Validation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16558-0_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T01:02:26Z","timestamp":1559782946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16558-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642165573","9783642165580"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16558-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}