{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:41Z","timestamp":1725897641511},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315848"},{"type":"electronic","value":"9783642315855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_7","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T07:56:29Z","timestamp":1340438189000},"page":"30-41","source":"Crossref","is-referenced-by-count":0,"title":["Algebraic Synchronization Trees and Processes"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Carayol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/inco.1991.9999","volume":"92","author":"S. Abramsky","year":"1991","unstructured":"Abramsky, S.: A Domain Equation for Bisimulation. Inf.\u00a0Comput.\u00a092(2), 161\u2013218 (1991)","journal-title":"Inf.\u00a0Comput."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A.V. Aho","year":"1968","unstructured":"Aho, A.V.: Indexed Grammars \u2014 an Extension of Context-Free Grammars. J. ACM\u00a015, 647\u2013671 (1968)","journal-title":"J. ACM"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195003"},{"key":"7_CR4","unstructured":"de Bakker, J.W.: Recursive Procedures. Mathematical Centre Tracts, vol. 24. Mathematisch Centrum, Amsterdam (1971)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-13345-3_7","volume-title":"Automata, Languages, and Programming","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 82\u201394. Springer, Heidelberg (1984)"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1993.1001","volume":"102","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z., Taubner, D.: Iteration Theories of Synchronization Trees. Inf. Comput.\u00a0102(1), 1\u201355 (1993)","journal-title":"Inf. Comput."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories. Springer (1993)","DOI":"10.1007\/978-3-642-78034-9"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ic.2005.01.004","volume":"197","author":"S.L. Bloom","year":"2005","unstructured":"Bloom, S.L., \u00c9sik, Z.: The Equational Theory of Regular Words. Inf. Comput.\u00a0197, 55\u201389 (2005)","journal-title":"Inf. Comput."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.tcs.2009.06.040","volume":"411","author":"S.L. Bloom","year":"2010","unstructured":"Bloom, S.L., \u00c9sik, Z.: A Mezei-Wright Theorem for Categorical Algebras. Theor. Comput. Sci.\u00a0411, 341\u2013359 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00403-5","volume":"258","author":"F. Breugel van","year":"2001","unstructured":"van Breugel, F.: An Introduction to Metric Semantics: Operational and Denotational Models for Programming and Specification Languages. Theor. Comput. Sci.\u00a0258, 1\u201398 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-24597-1_10","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Carayol","year":"2003","unstructured":"Carayol, A., W\u00f6hrle, S.: The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 112\u2013123. Springer, Heidelberg (2003)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On Infinite Terms Having a Decidable Monadic Theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(01)00089-5","volume":"290","author":"D. Caucal","year":"2003","unstructured":"Caucal, D.: On Infinite Transition Graphs Having a Decidable Monadic Theory. Theor. Comput. Sci.\u00a0290, 79\u2013115 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR14","unstructured":"Christensen, S.: Decidability and Decomposition in Process Algebras. PhD thesis ECS-LFCS-93-278, Department of Computer Science, Univ. of Edinburgh (1983)"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(78)90008-7","volume":"6","author":"B. Courcelle","year":"1978","unstructured":"Courcelle, B.: A Representation of Trees by Languages I and II. Theor. Comput. Sci.\u00a06, 255\u2013279 (1978); Theor. Comput. Sci. 7, 25\u201355","journal-title":"Theor. Comput. Sci."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental Properties of Infinite Trees. Theor. Comput. Sci.\u00a025, 69\u201395 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1093\/logcom\/12.2.271","volume":"12","author":"Z. \u00c9sik","year":"2002","unstructured":"\u00c9sik, Z.: Continuous Additive Algebras and Injective Simulations of Synchronization Trees. J. Log. Comput.\u00a012, 271\u2013300 (2002)","journal-title":"J. Log. Comput."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Fischer, M.J.: Grammars with Macro-like Productions. In: 9th Annual Symp. Switching and Automata Theory, pp. 131\u2013142. IEEE Press (1968)","DOI":"10.1109\/SWAT.1968.12"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J.A. Goguen","year":"1977","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Initial algebra semantics and continuous algebras. J. ACM\u00a024, 68\u201395 (1977)","journal-title":"J. ACM"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10284-1","volume-title":"Algebraic Semantics","author":"I. Guessarian","year":"1981","unstructured":"Guessarian, I.: Algebraic Semantics. LNCS, vol.\u00a099. Springer, Heidelberg (1981)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2006.07.002","volume":"366","author":"S. Milius","year":"2006","unstructured":"Milius, S., Moss, L.: The Category-Theoretic Solution of Recursive Program Schemes. Theor. Comput. Sci.\u00a0366, 3\u201359 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR22","unstructured":"Milner, R.: An Algebraic Definition of Simulation Between Programs. In: Proceedings 2nd Joint Conference on Artificial Intelligence, pp. 481\u2013489. BCS (1971)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"7_CR24","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"CONCUR \u201996: Concurrency Theory","author":"F. Moller","year":"1996","unstructured":"Moller, F.: Infinite Results. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 195\u2013216. Springer, Heidelberg (1996)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M.R. Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Scott, D.S.: The Lattice of Flow Diagrams. In: Symposium on Semantics of Algorithmic Languages 1971. Lecture Notes in Mathematics, vol.\u00a0188, pp. 311\u2013366. Springer (1971)","DOI":"10.1007\/BFb0059703"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-46011-X_10","volume-title":"Developments in Language Theory","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: A Short Introduction to Infinite Automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 130\u2013144. Springer, Heidelberg (2002)"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-45138-9_6","volume-title":"Mathematical Foundations of Computer Science 2003","author":"W. Thomas","year":"2003","unstructured":"Thomas, W.: Constructing Infinite Graphs with a Decidable MSO-Theory. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 113\u2013124. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:13:52Z","timestamp":1620116032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}