{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T08:44:39Z","timestamp":1743497079223,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319924076"},{"type":"electronic","value":"9783319924083"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92408-3_6","type":"book-chapter","created":{"date-parts":[[2018,5,26]],"date-time":"2018-05-26T17:08:42Z","timestamp":1527354522000},"page":"142-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Rule-Based Form for Stream Constraints"],"prefix":"10.1007","author":[{"given":"Kasper","family":"Dokter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhad","family":"Arbab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1017\/S0960129504004153","volume":"14","author":"F Arbab","year":"2004","unstructured":"Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329\u2013366 (2004). https:\/\/doi.org\/10.1017\/S0960129504004153","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR2","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. 7000, pp. 169\u2013206. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24933-4_9"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-40020-2_2","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F Arbab","year":"2003","unstructured":"Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2002. LNCS, vol. 2755, pp. 34\u201355. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40020-2_2"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-02053-7_13","volume-title":"Coordination Models and Languages","author":"C Baier","year":"2009","unstructured":"Baier, C., Blechmann, T., Klein, J., Kl\u00fcppelholz, S.: A uniform framework for modeling and verifying components and connectors. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol. 5521, pp. 247\u2013267. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02053-7_13"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/3-540-63165-8_199","volume-title":"Automata, Languages and Programming","author":"C Baier","year":"1997","unstructured":"Baier, C., Clarke, E.M., Hartonas-Garmhausen, V., Kwiatkowska, M., Ryan, M.: Symbolic model checking for probabilistic processes. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 430\u2013440. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63165-8_199"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.scico.2005.10.008","volume":"61","author":"C Baier","year":"2006","unstructured":"Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2), 75\u2013113 (2006). https:\/\/doi.org\/10.1016\/j.scico.2005.10.008","journal-title":"Sci. Comput. Program."},{"issue":"8","key":"6_CR7","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"JR Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: $$10~\\hat{}~20$$ states and beyond. Inf. Comput. 98(2), 142\u2013170 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90017-A","journal-title":"Inf. Comput."},{"issue":"8","key":"6_CR9","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1016\/j.scico.2010.05.004","volume":"76","author":"D Clarke","year":"2011","unstructured":"Clarke, D., Proen\u00e7a, J., Lazovik, A., Arbab, F.: Channel-based coordination via constraint satisfaction. Sci. Comput. Program. 76(8), 681\u2013710 (2011). https:\/\/doi.org\/10.1016\/j.scico.2010.05.004","journal-title":"Sci. Comput. Program."},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.L. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71999-1","DOI":"10.1007\/978-3-540-71999-1"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Dokter, K., Arbab, F.: Treo: textual syntax of reo connectors. In: Proceedings of MeTRiD 2018 (2018, to appear)","DOI":"10.4204\/EPTCS.272.10"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-14186-7_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"R Ehlers","year":"2010","unstructured":"Ehlers, R.: Minimising deterministic B\u00fcchi automata precisely using SAT solving. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 326\u2013332. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14186-7_28"},{"key":"6_CR13","unstructured":"Jongmans, S.T.Q.: Automata-theoretic protocol programming. Ph.D. thesis, Centrum Wiskunde & Informatica (CWI), Faculty of Science, Leiden University (2016). http:\/\/hdl.handle.net\/1887\/38223"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-19282-6_8","volume-title":"Lecture Notes in Computer Science","author":"Sung-Shik T. Q. Jongmans","year":"2015","unstructured":"Jongmans, S.-S.T.Q., Arbab, F.: Take Command of Your Constraints! In: Proceedings of Coordination Models and Languages - 17th IFIP WG 6.1 International Conference, COORDINATION 2015, Held as Part of the 10th International Federated Conference on Distributed Computing Techniques, DisCoTec 2015, Grenoble, France, June 2-4, 2015, pp. 117\u2013132 (2015). https:\/\/doi.org\/10.1007\/978-3-319-19282-6_8"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Jongmans, S.T.Q., Arbab, F.: Centralized coordination vs. partially-distributed coordination with Reo and constraint automata. Sci. Comput. Program. (2017). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167642317301259","DOI":"10.1016\/j.scico.2017.06.004"},{"key":"6_CR16","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-STQ 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. 8459, pp. 65\u201382. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43376-8_5"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.scico.2017.03.006","volume":"146","author":"STQ Jongmans","year":"2017","unstructured":"Jongmans, S.T.Q., Kapp\u00e9, T., Arbab, F.: Constraint automata with memory cells and their composition. Sci. Comput. Program. 146, 50\u201386 (2017). https:\/\/doi.org\/10.1016\/j.scico.2017.03.006","journal-title":"Sci. Comput. Program."},{"issue":"7\u20138","key":"6_CR18","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/j.scico.2011.02.003","volume":"77","author":"S Kemper","year":"2012","unstructured":"Kemper, S.: SAT-based verification for timed component connectors. Sci. Comput. Program. 77(7\u20138), 779\u2013798 (2012). https:\/\/doi.org\/10.1016\/j.scico.2011.02.003","journal-title":"Sci. Comput. Program."},{"key":"6_CR19","unstructured":"Kl\u00fcppelholz, S.: Verification of Branching-Time and Alternating-Time Properties for Exogenous Coordination Models. Ph.D. thesis, Dresden University of Technology (2012). http:\/\/www.qucosa.de\/recherche\/frontdoor\/?tx_slubopus4frontend[id]=8621"},{"issue":"7","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.ic.2007.01.004","volume":"205","author":"MZ Kwiatkowska","year":"2007","unstructured":"Kwiatkowska, M.Z., Norman, G., Sproston, J., Wang, F.: Symbolic model checking for probabilistic timed automata. Inf. Comput. 205(7), 1027\u20131077 (2007). https:\/\/doi.org\/10.1016\/j.ic.2007.01.004","journal-title":"Inf. Comput."},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"6_CR22","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, 11\u201313 January 1989, pp. 179\u2013190. ACM Press (1989). http:\/\/doi.acm.org\/10.1145\/75277.75293"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, 22\u201324 October 1990, vol. II, pp. 746\u2013757. IEEE Computer Society (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89597","DOI":"10.1109\/FSCS.1990.89597"},{"key":"6_CR24","unstructured":"Proen\u00e7a, J., Clarke, D., de Vink, E.P., Arbab, F.: Dreams: a framework for distributed synchronous coordination. In: Ossowski, S., Lecca, P. (eds.) Proceedings of the ACM Symposium on Applied Computing, SAC 2012, Riva, Trento, Italy, 26\u201330 March 2012, pp. 1510\u20131515. ACM (2012). http:\/\/doi.acm.org\/10.1145\/2245276.2232017"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/S1571-0661(04)80972-1","volume":"45","author":"JJMM Rutten","year":"2001","unstructured":"Rutten, J.J.M.M.: Elements of stream calculus (an extensive exercise in coinduction). Electr. Notes Theor. Comput. Sci. 45, 358\u2013423 (2001). https:\/\/doi.org\/10.1016\/S1571-0661(04)80972-1","journal-title":"Electr. Notes Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92408-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:27:40Z","timestamp":1654734460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-92408-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319924076","9783319924083"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92408-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Languages and Models","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.discotec.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}