{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:21Z","timestamp":1725545061944},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_6","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"66-77","source":"Crossref","is-referenced-by-count":0,"title":["Strong Retiming Equivalence of Synchronous Schemes"],"prefix":"10.1007","author":[{"given":"Mikl\u00f3s","family":"Bartha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(92)90307-2","volume":"100","author":"M. Bartha","year":"1992","unstructured":"Bartha, M.: Foundations of a theory of synchronous systems. Theoret. Comput. Sci.\u00a0100, 325\u2013346 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0890-5401(92)90006-2","volume":"97","author":"M. Bartha","year":"1992","unstructured":"Bartha, M.: An algebraic model of synchronous systems. Information and Computation\u00a097, 97\u2013131 (1992)","journal-title":"Information and Computation"},{"key":"6_CR3","unstructured":"Bartha, M., Cirovic, B.: On some equivalence notions of synchronous systems. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) Proceedings, 11th International Conference on Automata and Formal Languages, Dogog\u00f3k\u0151, Hungary (2005)"},{"key":"6_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1971","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer, Berlin (1971)"},{"key":"6_CR5","volume-title":"Universal Algebra","author":"G. Gr\u00e4tzer","year":"1968","unstructured":"Gr\u00e4tzer, G.: Universal Algebra. Springer, Berlin (1968) (1979)"},{"key":"6_CR6","first-page":"41","volume":"1","author":"C.E. Leiserson","year":"1983","unstructured":"Leiserson, C.E., Saxe, J.B.: Optimizing synchronous systems. J. VLSI Comput. Systems\u00a01, 41\u201367 (1983)","journal-title":"J. VLSI Comput. Systems"},{"key":"6_CR7","volume-title":"Algebraic Theory of Automata","author":"F. G\u00e9cseg","year":"1972","unstructured":"G\u00e9cseg, F., Pe\u00e1k, I.: Algebraic Theory of Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1972)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1051\/ita:2002009","volume":"36","author":"P. Katis","year":"2002","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Feedback, trace, and fixed-point semantics. Theoret. Informatics Appl.\u00a036, 181\u2013194 (2002)","journal-title":"Theoret. Informatics Appl."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(87)90104-6","volume":"55","author":"M. Bartha","year":"1987","unstructured":"Bartha, M.: An equational axiomatization of systolic systems. Theoret. Comput. Sci.\u00a055, 265\u2013289 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR10","first-page":"175","volume-title":"Logic Colloquium 73","author":"C.C. Elgot","year":"1975","unstructured":"Elgot, C.C.: Monadic computations and iterative algebraic theories. In: Rose, H.E. (ed.) Logic Colloquium 73, pp. 175\u2013230. North-Holland, Amsterdam (1975)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Elgot, C.C.: Selected Papers. In: Bloom, S.L. (ed.), Springer, New York (1982)","DOI":"10.1007\/978-1-4613-8177-8"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/TCS.1977.1084357","volume":"7","author":"T. Murata","year":"1977","unstructured":"Murata, T.: Circuit theoretic analysis and synthesis of marked graphs. IEEE Transactions on Circuits and Systems CAS-24\u00a07, 400\u2013405 (1977)","journal-title":"IEEE Transactions on Circuits and Systems CAS-24"},{"key":"6_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories. Springer, Berlin (1993)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(79)90031-8","volume":"9","author":"S.L. Bloom","year":"1979","unstructured":"Bloom, S.L., Tindell, R.: Algebraic and graph theoretic characterizations of structured flowchart schemes. Theoret. Comput. Sci.\u00a09, 265\u2013286 (1979)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:25Z","timestamp":1619507125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11605157_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}