{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:55:38Z","timestamp":1762458938009,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642272684"},{"type":"electronic","value":"9783642272691"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27269-1_14","type":"book-chapter","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T05:52:10Z","timestamp":1326779530000},"page":"237-258","source":"Crossref","is-referenced-by-count":3,"title":["Decomposition of Constraint Automata"],"prefix":"10.1007","author":[{"given":"Bahman","family":"Pourvatan","sequence":"first","affiliation":[]},{"given":"Marjan","family":"Sirjani","sequence":"additional","affiliation":[]},{"given":"Farhad","family":"Arbab","sequence":"additional","affiliation":[]},{"given":"Marcello M.","family":"Bonsangue","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_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. Mathematical Structures in Computer Science\u00a014, 329\u2013366 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.entcs.2004.04.028","volume":"97","author":"F. Arbab","year":"2004","unstructured":"Arbab, F., Baier, C., Rutten, J.J.M.M., Sirjani, M.: Modeling component connectors in Reo by constraint automata (extended abstract). Electr. Notes Theor. Comput. Sci.\u00a097, 25\u201346 (2004)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"14_CR3","first-page":"371","volume-title":"ASE","author":"N.R. Mehta","year":"2004","unstructured":"Mehta, N.R., Medvidovic, N., Sirjani, M., Arbab, F.: Modeling behavior in compositions of software architectural primitives. In: ASE, pp. 371\u2013374. IEEE Computer Society, Los Alamitos (2004)"},{"key":"14_CR4","first-page":"113","volume-title":"MEMOCODE","author":"N. Razavi","year":"2006","unstructured":"Razavi, N., Sirjani, M.: Using Reo for formal specification and verification of system designs. In: MEMOCODE, pp. 113\u2013122. IEEE, Los Alamitos (2006)"},{"key":"14_CR5","first-page":"346","volume-title":"SAC","author":"S. Meng","year":"2007","unstructured":"Meng, S., Arbab, F.: Web services choreography and orchestration in Reo and constraint automata. In: Cho, Y., Wainwright, R.L., Haddad, H., Shin, S.Y., Koo, Y.W. (eds.) SAC, pp. 346\u2013353. ACM, New York (2007)"},{"key":"14_CR6","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 2003. LNCS, vol.\u00a02755, pp. 34\u201355. Springer, Heidelberg (2003)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput.\u00a01, 131\u2013137 (1972)","journal-title":"SIAM J. Comput."},{"key":"14_CR8","series-title":"Transactions of the American Mathematical Society","first-page":"450","volume-title":"Algebraic theory of machines. I. prime decomposition theorem for finite semigroups and machines","author":"K. Krohn","year":"1965","unstructured":"Krohn, K., Rhodes, J.: Algebraic theory of machines. I. prime decomposition theorem for finite semigroups and machines. Transactions of the American Mathematical Society, vol.\u00a0116, pp. 450\u2013464. ACM, New York (1965)"},{"key":"14_CR9","unstructured":"Eilenberg, S.: Automata, languages and machines (1976)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-30500-2_32","volume-title":"Implementation and Application of Automata","author":"A. Egri-Nagy","year":"2005","unstructured":"Egri-Nagy, A., Nehaniv, C.L.: Algebraic hierarchical decomposition of finite state automata: Comparison of implementations for Krohn-Rhodes theory. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 315\u2013316. Springer, Heidelberg (2005)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.: On the definition of a family of automata. Information and Control, 245\u2013270 (1961)","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Kozen, D.: On Kleene algebras and closed semirings. In: Proc. Mathematical Foundations in Computer Science, vol.\u00a0452, pp. 26\u201347 (1990)","DOI":"10.1007\/BFb0029594"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11417019_16","volume-title":"Coordination Models and Languages","author":"F. Arbab","year":"2005","unstructured":"Arbab, F., Baier, C., de Boer, F.S., Rutten, J.J.M.M., Sirjani, M.: Synthesis of Reo circuits for implementation of component-connector automata specifications. In: Jacquet, J.M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol.\u00a03454, pp. 236\u2013251. Springer, Heidelberg (2005)"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1145\/1529282.1529587","volume-title":"SAC","author":"C. Koehler","year":"2009","unstructured":"Koehler, C., Clarke, D.: Decomposing port automata. In: Shin, S.Y., Ossowski, S. (eds.) SAC, pp. 1369\u20131373. ACM, New York (2009)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-02979-0_6","volume-title":"Implementation and Application of Automata","author":"J. Vuillemin","year":"2009","unstructured":"Vuillemin, J., Gama, N.: Compact normal form for regular languages as xor automata. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 24\u201333. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27269-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T17:53:43Z","timestamp":1686678823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27269-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642272684","9783642272691"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27269-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}