{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:10:08Z","timestamp":1745964608921,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370564"},{"type":"electronic","value":"9783642370571"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37057-1_14","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:37:04Z","timestamp":1361216224000},"page":"194-209","source":"Crossref","is-referenced-by-count":0,"title":["Scenario Realizability with Constraint Optimization"],"prefix":"10.1007","author":[{"given":"Rouwaida","family":"Abdallah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Gotlieb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Jard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abdallah, R., Jard, C., H\u00e9lou\u00ebt, L.: Distributed implementation of message sequence charts. Software and Systems Modeling (to appear, 2013)","DOI":"10.1007\/s10270-013-0357-1"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/3-540-48224-5_65","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Realizability and Verification of MSC Graphs. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 797\u2013808. Springer, Heidelberg (2001)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-77050-3_23","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"N. Baudru","year":"2007","unstructured":"Baudru, N., Morin, R.: Synthesis of Safe Message-Passing Systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 277\u2013289. Springer, Heidelberg (2007)"},{"key":"14_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-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)"},{"key":"14_CR5","unstructured":"Brand, D., Zafiropoulo, P.: On communicating finite state machines. Technical Report 1053, IBM Zurich Research Lab. (1981)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M. Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An Open-Ended Finite Domain Constraint Solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol.\u00a01292, pp. 191\u2013206. Springer, Heidelberg (1997)"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.jcss.2005.09.007","volume":"72","author":"B. Genest","year":"2006","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level MSCs: Model-checking and realizability. Journal on Comp. and System Sciences\u00a072(4), 617\u2013647 (2006)","journal-title":"Journal on Comp. and System Sciences"},{"key":"14_CR8","unstructured":"H\u00e9lou\u00ebt, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: Proc. of FMICS 2000 (2000)"},{"key":"14_CR9","unstructured":"ITU-T. Message sequence charts (msc). In ITU standard Z.120 (1999)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Liang, H., Dingel, J., Diskin, Z.: A comparative survey of scenario-based to state-based model synthesis approaches. In: Proc. of SCESM 2006: the 2006 International Workshop on Scenarios and State Machines: Models, Algorithms, and Tools, pp. 5\u201312 (2006)","DOI":"10.1145\/1138953.1138956"},{"issue":"1-3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.tcs.2003.08.002","volume":"309","author":"M. Lohrey","year":"2003","unstructured":"Lohrey, M.: Realizability of high-level message sequence charts: closing the gaps. Theoretical Computer Science\u00a0309(1-3), 529\u2013554 (2003)","journal-title":"Theoretical Computer Science"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press (1998)","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Reniers, M., Mauw, S.: High-level Message Sequence Charts. In: SDL 1997: Time for Testing - SDL, MSC and Trends, Proc. of the 8th SDL Forum, pp. 291\u2013306 (1997)","DOI":"10.1016\/B978-044482816-3\/50020-4"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Roychoudhury, A., Thiagarajan, P.S.: Communicating transaction processes. In: ACSD 2003, pp. 157\u2013166. IEEE Computer Society (2003)","DOI":"10.1109\/CSD.2003.1207710"},{"issue":"1-3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","volume":"37","author":"P. Hentenryck Van","year":"1998","unstructured":"Van Hentenryck, P., Saraswat, V.A., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(fd). J. Log. Program.\u00a037(1-3), 139\u2013164 (1998)","journal-title":"J. Log. Program."}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37057-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:32:39Z","timestamp":1745962359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37057-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370564","9783642370571"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37057-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}