{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:43:56Z","timestamp":1743075836994,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319192819"},{"type":"electronic","value":"9783319192826"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19282-6_8","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T07:05:56Z","timestamp":1430291156000},"page":"117-132","source":"Crossref","is-referenced-by-count":5,"title":["Take Command of Your Constraints!"],"prefix":"10.1007","author":[{"given":"Sung-Shik T. Q.","family":"Jongmans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhad","family":"Arbab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-662-43376-8_5","volume-title":"Coordination Models and Languages","author":"S.-S.T.Q. Jongmans","year":"2014","unstructured":"Jongmans, S.-S.T.Q., Halle, S., Arbab, F.: Automata-Based Optimization of Interaction Protocols for Scalable Multicore Platforms. In: K\u00fchn, E., Pugliese, R. (eds.) COORDINATION 2014. LNCS, vol.\u00a08459, pp. 65\u201382. Springer, Heidelberg (2014)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Jongmans, S.S., Halle, S., Arbab, F.: Reo: A Dataflow Inspired Language for Multicore. In: DFM, 42\u201350. IEEE (2013)","DOI":"10.1109\/DFM.2013.14"},{"key":"8_CR3","first-page":"75","volume":"61","author":"C. Baier","year":"2006","unstructured":"Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by constraint automata. SCP\u00a061, 75\u2013113 (2006)","journal-title":"SCP"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/3-540-61052-9_37","volume-title":"Coordination Languages and Models","author":"P. Wegner","year":"1996","unstructured":"Wegner, P.: Coordination as Constrained Interaction (Extended Abstract). In: Hankin, C., Ciancarini, P. (eds.) COORDINATION 1996. LNCS, vol.\u00a01061, pp. 28\u201333. Springer, Heidelberg (1996)"},{"key":"8_CR5","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-45364-9_15","volume-title":"Advances in Service-Oriented and Cloud Computing","author":"S.-S.T.Q. Jongmans","year":"2013","unstructured":"Jongmans, S.-S.T.Q., Arbab, F.: Global consensus through local synchronization. In: Canal, C., Villari, M. (eds.) ESOCC 2013. CCIS, vol.\u00a0393, pp. 174\u2013188. Springer, Heidelberg (2013)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Jongmans, S.S., Arbab, F.: Toward Sequentializing Overparallelized Protocol Code. In: ICE. EPTCS, vol. 166. CoRR, 38\u201344 (2014)","DOI":"10.4204\/EPTCS.166.5"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Jongmans, S.-S., Santini, F., Arbab, F.: Partially-Distributed Coordination with Reo. In: PDP 2014, pp. 697\u2013706. IEEE (2014)","DOI":"10.1109\/PDP.2014.19"},{"issue":"3","key":"8_CR8","first-page":"329","volume":"14","author":"F. Arbab","year":"2004","unstructured":"Arbab, F.: Reo: a channel-based coordination model for component composition. MSCS\u00a014(3), 329\u2013366 (2004)","journal-title":"MSCS"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-24933-4_9","volume-title":"Formal Modeling: Actors, Open Systems, Biological Systems","author":"F. Arbab","year":"2011","unstructured":"Arbab, F.: Puff, The Magic Protocol. In: Agha, G., Danvy, O., Meseguer, J. (eds.) Formal Modeling: Actors, Open Systems, Biological Systems. LNCS, vol.\u00a07000, pp. 169\u2013206. Springer, Heidelberg (2011)"},{"key":"8_CR10","series-title":"CCIS","first-page":"108","volume-title":"ISoLA 2008","author":"F. Arbab","year":"2008","unstructured":"Arbab, F., Kokash, N., Meng, S.: Towards Using Reo for Compliance-Aware Business Process Modeling. In: Margaria, T., Steffen, B. (eds.) ISoLA 2008. CCIS, vol.\u00a017, pp. 108\u2013123. Springer, Heidelberg (2008)"},{"key":"8_CR11","unstructured":"Changizi, B., Kokash, N., Arbab, F.: A Unified Toolset for Business Process Model Formalization. In: Buhnova, B., Happe, J. (eds.) FESCA 2010, pp. 147\u2013156 (2010)"},{"issue":"8","key":"8_CR12","first-page":"651","volume":"76","author":"S. Meng","year":"2011","unstructured":"Meng, S., Arbab, F., Baier, C.: Synthesis of Reo circuits from scenario-based interaction specifications. SCP\u00a076(8), 651\u2013680 (2011)","journal-title":"SCP"},{"issue":"2","key":"8_CR13","first-page":"167","volume":"36","author":"S. Bliudze","year":"2010","unstructured":"Bliudze, S., Sifakis, J.: Causal semantics for the algebra of connectors. FMSD\u00a036(2), 167\u2013194 (2010)","journal-title":"FMSD"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Jongmans, S.S., Arbab, F.: Take Command of Your Constraints (Technical Report). Technical Report FM-1501, CWI (2015)","DOI":"10.1007\/978-3-319-19282-6_8"},{"key":"8_CR15","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence, 2nd edn. Prentice-Hall (2003)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Apt, K., de Boer, F., Olderog, E.-R.: Verification of Sequential and Concurrent Programs, 3rd edn. Springer (2009)","DOI":"10.1007\/978-1-84882-745-5"},{"issue":"10","key":"8_CR17","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"T. Hoare","year":"1969","unstructured":"Hoare, T.: An Axiomatic Basis for Computer Programming. CACM\u00a012(10), 576\u2013580 (1969)","journal-title":"CACM"},{"issue":"11","key":"8_CR18","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"A. Kahn","year":"1962","unstructured":"Kahn, A.: Topological Sorting in Large Networks. CACM\u00a05(11), 558\u2013562 (1962)","journal-title":"CACM"},{"key":"8_CR19","unstructured":"Knuth, D.: Fundamental Algorithms, 3rd edn. The Art of Computer Programming, vol.\u00a01. Addison-Wesley (1997)"},{"key":"8_CR20","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Algorithms and Combinatorics, vol.\u00a021. Springer (2008)"},{"key":"8_CR21","first-page":"177","volume":"42","author":"G. Gallo","year":"1993","unstructured":"Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed hypergraphs and applications. DAM\u00a042, 177\u2013201 (1993)","journal-title":"DAM"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0020-0190(92)90057-3","volume":"44","author":"G. Woeginger","year":"1992","unstructured":"Woeginger, G.: The complexity of finding arborescences in hypergraphs. IPL\u00a044, 161\u2013164 (1992)","journal-title":"IPL"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-45446-2_20","volume-title":"Theoretical Computer Science","author":"G. Ausiello","year":"2001","unstructured":"Ausiello, G., Franciosa, P.G., Frigioni, D.: Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202, pp. 312\u2013328. Springer, Heidelberg (2001)"},{"key":"8_CR24","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press (2009)"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0004-3702(02)00263-1","volume":"141","author":"C. Bessi\u00e8re","year":"2002","unstructured":"Bessi\u00e8re, C., Meseguer, P., Freuder, E., Larrosa, J.: On forward checking for non-binary constraint satisfaction. Artificial Intelligence\u00a0141, 205\u2013224 (2002)","journal-title":"Artificial Intelligence"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","volume":"19","author":"J. McGregor","year":"1979","unstructured":"McGregor, J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphism. Information Science\u00a019, 229\u2013250 (1979)","journal-title":"Information Science"},{"issue":"8","key":"8_CR27","first-page":"681","volume":"76","author":"D. Clarke","year":"2011","unstructured":"Clarke, D., Proen\u00e7a, J., Lazovik, A., Arbab, F.: Channel-based coordination via constraint satisfaction. SCP\u00a076(8), 681\u2013710 (2011)","journal-title":"SCP"},{"key":"8_CR28","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-45364-9_14","volume-title":"Advances in Service-Oriented and Cloud Computing","author":"J. Proen\u00e7a","year":"2013","unstructured":"Proen\u00e7a, J., Clarke, D.: Data Abstraction in Coordination Constraints. In: Canal, C., Villari, M. (eds.) ESOCC 2013. CCIS, vol.\u00a0393, pp. 159\u2013173. Springer, Heidelberg (2013)"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-38493-6_15","volume-title":"Coordination Models and Languages","author":"J. Proen\u00e7a","year":"2013","unstructured":"Proen\u00e7a, J., Clarke, D.: Interactive Interaction Constraints. In: De Nicola, R., Julien, C. (eds.) COORDINATION 2013. LNCS, vol.\u00a07890, pp. 211\u2013225. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19282-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T19:11:16Z","timestamp":1559157076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19282-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319192819","9783319192826"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19282-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}