{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:51:53Z","timestamp":1725511913075},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540712084"},{"type":"electronic","value":"9783540712091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71209-1_32","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T22:56:34Z","timestamp":1183589794000},"page":"420-434","source":"Crossref","is-referenced-by-count":2,"title":["Detecting Races in Ensembles of Message Sequence Charts"],"prefix":"10.1007","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_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 Transactions on Software Engineering\u00a029, 623\u2013633 (2003)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"2","key":"32_CR2","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"Alur, R., Holzmann, G., Peled, D.: An analyzer for message sequence charts. Software Concepts and Tools\u00a017(2), 70\u201377 (1996)","journal-title":"Software Concepts and Tools"},{"key":"32_CR3","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":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BFb0035393","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Ben-Abdulla","year":"1997","unstructured":"Ben-Abdulla, H., Leue, S.: Symbolic detection of process divergence and non-local choice in message sequence charts. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 259\u2013274. Springer, Heidelberg (1997)"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1023\/A:1011227529550","volume":"19","author":"W. Damm","year":"2001","unstructured":"Damm, W., Harel, D.: LSCs: breathing life into message sequence charts. Formal Methods in System Design\u00a019, 45\u201380 (2001)","journal-title":"Formal Methods in System Design"},{"key":"32_CR6","unstructured":"H\u00e9lou\u00ebt, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: 5th International Workshop on Formal Methods for Industrial Critical Systems (2000)"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1002\/bltj.2034","volume":"2","author":"G. Holzmann","year":"1997","unstructured":"Holzmann, G., Peled, D., Redberg, M.: Design tools for requirements engineering. Bell Labs Technical Journal\u00a02, 86\u201395 (1997)","journal-title":"Bell Labs Technical Journal"},{"key":"32_CR8","unstructured":"ITU-T Recommendation Z.120, Message Sequence Chart (MSC), Geneva (1996)"},{"key":"32_CR9","unstructured":"Krueger, I.: Distributed system design with message sequence charts. Ph.D. Thesis, TU Munchen (2000)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0890-5401(03)00123-8","volume":"187","author":"D. Kuske","year":"2003","unstructured":"Kuske, D.: Regular sets of infinite message sequence charts. Information and Computation\u00a0187, 80\u2013109 (2003)","journal-title":"Information and Computation"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45694-5_13","volume-title":"CONCUR 2002 - Concurrency Theory","author":"M. Lohrey","year":"2002","unstructured":"Lohrey, M.: Safe realizability of high-level message sequence charts. In: Brim, L., et al. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 177\u2013192. Springer, Heidelberg (2002)"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/3-540-48224-5_66","volume-title":"Automata, Languages and Programming","author":"P. Madhusudan","year":"2001","unstructured":"Madhusudan, P.: Reasoning about sequential and branching behaviours of message sequence graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 809\u2013820. Springer, Heidelberg (2001)"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-44618-4_37","volume-title":"CONCUR 2000 - Concurrency Theory","author":"M. Mukund","year":"2000","unstructured":"Mukund, M., Narayan Kumar, K., Sohoni, M.: Synthesizing distributed finite-state systems from MSCs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 521\u2013535. Springer, Heidelberg (2000)"},{"key":"32_CR14","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)"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Muscholl","year":"1998","unstructured":"Muscholl, A., Peled, D., Su, Z.: Deciding properties of message sequence charts. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol.\u00a01378, pp. 226\u2013242. Springer, Heidelberg (1998)"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Sengupta, B., Cleaveland, R.: Triggered message sequence charts. IEEE TSE (2006)","DOI":"10.1109\/TSE.2006.82"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71209-1_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:16:47Z","timestamp":1605763007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71209-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540712084","9783540712091"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71209-1_32","relation":{},"subject":[]}}