{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:43:33Z","timestamp":1725558213566},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407539"},{"type":"electronic","value":"9783540451877"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/978-3-540-45187-7_21","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T22:38:49Z","timestamp":1277505529000},"page":"311-326","source":"Crossref","is-referenced-by-count":8,"title":["High-Level Message Sequence Charts and Projections"],"prefix":"10.1007","author":[{"given":"Blaise","family":"Genest","sequence":"first","affiliation":[]},{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/3-540-61042-1_37","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Alur","year":"1996","unstructured":"Alur, R., Holzmann, G., Peled, D.: An Analyser for Message Sequence Charts. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 35\u201348. Springer, Heidelberg (1996)"},{"key":"21_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":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/3-540-45465-9_56","volume-title":"Automata, Languages and Programming","author":"B. Genest","year":"2002","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state HMSCs: Modelchecking and realizability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 657\u2013668. Springer, Heidelberg (2002)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Govindaraju, S., Dill, D.: Counterexample-guided choice of projections in approximate symbolic model checking. In: Proceedings of ICCAD 2000 (2000)","DOI":"10.21236\/ADA401014"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Gunter","year":"2001","unstructured":"Gunter, E., Muscholl, A., Peled, D.: Compositional Message Sequence Charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 496\u2013511. Springer, Heidelberg (2001)"},{"key":"21_CR7","unstructured":"Harel, D., Damm, W.: LSCs: breathing life into Message Sequence Charts. Technical Report CS98-09, Weizmann Institute (Avril 1998)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Henriksen, J., Mukund, M., Kumar, K., Thiagarajan, P.: On Message Sequence Graphs and finitely generated regular MSC languages. In: ICALP 1999. LNCS, vol.\u00a01644 (1999)","DOI":"10.1007\/3-540-45022-X_57"},{"key":"21_CR9","unstructured":"H\u00e9lou\u00ebt, L., Le Maigat, P.: Decomposition of Message Sequence Charts. In: Proceedings of SAM2000(2nd conference on SDL and MSCs), Grenoble, Juin (2000)"},{"key":"21_CR10","unstructured":"ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITUTS, Geneva (September 1993)"},{"key":"21_CR11","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, p. 809. Springer, Heidelberg (2001)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3-540-49019-1_19","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Muscholl","year":"1999","unstructured":"Muscholl, A.: Matching specifications for Message Sequence Charts. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 273\u2013287. Springer, Heidelberg (1999)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (1999)"},{"key":"21_CR14","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 for Message Sequence Charts. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, p. 226. Springer, Heidelberg (1998)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Peled, D.: Specification and verification of Message Sequence Charts. In: Proceedings of FORTE 2000. IFIP 183, pp. 139\u2013154 (2000)","DOI":"10.1007\/978-0-387-35533-7_9"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"A. Pnueli","year":"2000","unstructured":"Pnueli, A.: Abstraction, composition, symmetry, and a little deduction: The remedies to state explosion. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2003 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45187-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:15:24Z","timestamp":1558293324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45187-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407539","9783540451877"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45187-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}