{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:58:35Z","timestamp":1725494315401},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755951"},{"type":"electronic","value":"9783540755968"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75596-8_27","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T14:03:37Z","timestamp":1194098617000},"page":"378-393","source":"Crossref","is-referenced-by-count":0,"title":["Quantifying the Discord: Order Discrepancies in Message Sequence Charts"],"prefix":"10.1007","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Spoletini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"27_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining Knowledge about Temporal Intervals. Communications of ACM\u00a026(11), 832\u2013843 (1983)","journal-title":"Communications of ACM"},{"key":"27_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 \u2014 Concepts and Tools\u00a017, 70\u201377 (1996)","journal-title":"Software \u2014 Concepts and Tools"},{"issue":"1","key":"27_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. Theoretical Computer Science\u00a0331(1), 97\u2013114 (2005)","journal-title":"Theoretical Computer Science"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BFb0035393","volume-title":"TACAS 1997","author":"H. Ben-Abdallah","year":"1997","unstructured":"Ben-Abdallah, H., Leue, S.: Syntactic 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)"},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On Communicating Finite-State Machines. Journal of the ACM\u00a030(2), 323\u2013342 (1983)","journal-title":"Journal of the ACM"},{"issue":"1","key":"27_CR6","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(1), 45\u201380 (2001)","journal-title":"Formal Methods in System Design"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"TACAS 2007","author":"E. Elkind","year":"2007","unstructured":"Elkind, E., Genest, B., Peled, D.: Detecting Races in Ensembles of Message Sequence Charts. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, Springer, Heidelberg (2007)"},{"key":"27_CR8","unstructured":"Elkind, E., Genest, B., Peled, D., Spoletini, P.: Quantifying the Discord: Order Discrepancies in Message Sequence Charts, available from \n                    \n                      http:\/\/perso.crans.org\/~genest\/EGPS07.pdf"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Floyd, R.W.: Algorithm 97 (Shortest Path). Communications of the ACM 356 (1962)","DOI":"10.1145\/367766.368168"},{"key":"27_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-19029-2","volume-title":"Come, Let\u2019s Play: Scenario-Based Programming Using LSCs and the Play-Engine","author":"D. Harel","year":"2003","unstructured":"Harel, D., Marelly, R.: Come, Let\u2019s Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer, Heidelberg (2003)"},{"key":"27_CR11","unstructured":"ITU Z120 standard recommendation (1996)"},{"issue":"5","key":"27_CR12","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/876638.876639","volume":"50","author":"A. Krokhin","year":"2003","unstructured":"Krokhin, A., Jeavons, P., Jonsson, P.: Reasoning about Temporal Relations: The Tractable Subalgebras of Allen\u2019s Interval Algebra. J. ACM\u00a050(5), 591\u2013640 (2003)","journal-title":"J. ACM"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ic.2003.10.002","volume":"189","author":"M. Lohrey","year":"2004","unstructured":"Lohrey, M., Muscholl, A.: Bounded MSC communication. Information and Computation\u00a0189, 160\u2013181 (2004)","journal-title":"Information and Computation"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"MFCS 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":"27_CR15","doi-asserted-by":"crossref","unstructured":"Peled, D.: Specification and Verification of Message Sequence Charts. In: FORTE 2000, IFIP CP 183, pp.\u00a0139\u2013154 (2000)","DOI":"10.1007\/978-0-387-35533-7_9"},{"issue":"1","key":"27_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S.: A Theorem on Boolean Matrices. Journal of the ACM\u00a09(1), 11\u201312 (1962)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75596-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:51:09Z","timestamp":1558277469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75596-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755951","9783540755968"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75596-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}