{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:45:27Z","timestamp":1794339927871,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_25","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"235-246","source":"Crossref","is-referenced-by-count":23,"title":["Weighted Logics for Traces"],"prefix":"10.1007","author":[{"given":"Ingmar","family":"Meinecke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"EATCS Monographs on Theoret. Comp. Sc.","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and Their Languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoret. Comp. Sc., vol.\u00a012. Springer, Heidelberg (1988)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/11537311_46","volume-title":"Fundamentals of Computation Theory","author":"B. Bollig","year":"2005","unstructured":"Bollig, B.: On the expressiveness of asynchronous cellular automata. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 528\u2013539. Springer, Heidelberg (2005)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. Theoret. Comp. Sc (to appear, 2006)","DOI":"10.1016\/j.tcs.2006.01.014"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math.\u00a0(6), 66\u201392 (1960)","DOI":"10.1002\/malq.19600060105"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-59126-6_8","volume-title":"Handbook of Formal Languages, Beyond Words, ch. 8","author":"V. Diekert","year":"1997","unstructured":"Diekert, V., M\u00e9tivier, Y.: Partial commutation and traces. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Beyond Words, ch. 8, vol.\u00a03, pp. 457\u2013534. Springer, Heidelberg (1997)"},{"key":"25_CR6","volume-title":"The Book of Traces","year":"1995","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/inco.1999.2799","volume":"153","author":"M. Droste","year":"1999","unstructured":"Droste, M., Gastin, P.: The Kleene-Sch\u00fctzenberger theorem for formal power series in partially commuting variables. Information and Computation\u00a0153, 47\u201380 (1999)","journal-title":"Information and Computation"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-662-04166-6_14","volume-title":"Formal Power Series and Algebraic Combinatorics (Moscow 2000)","author":"M. Droste","year":"2000","unstructured":"Droste, M., Gastin, P.: On aperiodic and star-free formal power series in partially commuting variables. In: Formal Power Series and Algebraic Combinatorics (Moscow 2000), pp. 158\u2013169. Springer, Berlin (2000)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/11523468_42","volume-title":"Automata, Languages and Programming","author":"M. Droste","year":"2005","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 513\u2013525. Springer, Heidelberg (2005)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Droste, M., Vogler, H.: Weighted tree automata and weighted logics (submitted, 2005)","DOI":"10.1007\/11523468_42"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Ebinger, W., Muscholl, A.: Logical definability on infinite traces. Theoret. Comp. Sc.\u00a0(154), 67\u201384 (1996)","DOI":"10.1016\/0304-3975(95)00130-1"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"C.C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., (98):21\u201352, 1961.","DOI":"10.1090\/S0002-9947-1961-0139530-9"},{"key":"25_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9333-5","volume-title":"Semirings and their Applications","author":"J.S. Golan","year":"1999","unstructured":"Golan, J.S.: Semirings and their Applications. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"25_CR14","volume-title":"Semirings: Algebraic Theory and Application","author":"U. Hebisch","year":"1999","unstructured":"Hebisch, U., Weinert, H.J.: Semirings: Algebraic Theory and Application. World Scientific, Singapore (1999)"},{"key":"25_CR15","series-title":"EATCS Monographs on Theoret. Comp. Sc","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoret. Comp. Sc, vol.\u00a05. Springer, Heidelberg (1986)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/11672142_56","volume-title":"STACS 2006","author":"D. Kuske","year":"2006","unstructured":"Kuske, D.: Weighted asynchronous cellular automata. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 684\u2013695. Springer, Heidelberg (2006)"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2004.07.005","volume":"328","author":"D. Kuske","year":"2004","unstructured":"Kuske, D., Meinecke, I.: Branching automata with costs \u2013 a way of reflecting parallelism in costs. Theoret. Comp. Sc.\u00a0328, 53\u201375 (2004)","journal-title":"Theoret. Comp. Sc."},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/11672142_25","volume-title":"STACS 2006","author":"I. M\u00e4urer","year":"2006","unstructured":"M\u00e4urer, I.: Weighted picture automata and weighted logics. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 313\u2013324. Springer, Heidelberg (2006)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","first-page":"279","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef","author":"A. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 279\u2013324. Springer, Heidelberg (1987)"},{"key":"25_CR20","unstructured":"Meinecke, I.: Weighted Branching Automata \u2013 Combining Concurrency and Weights. Dissertation, Technische Universit\u00e4t Dresden, Germany (December 2004)"},{"key":"25_CR21","unstructured":"Meinecke, I.: The Hadamard product of sequential-parallel series. J. of Automata, Languages and Combinatorics\u00a010(2) (toappear, 2005)"},{"key":"25_CR22","volume-title":"Texts and Monographs in Computer Science","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. In: Texts and Monographs in Computer Science, Springer, Heidelberg (1978)"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and Control\u00a04, 245\u2013270 (1961)","journal-title":"Information and Control"},{"key":"25_CR24","unstructured":"Thomas, W.: On logical definability of trace languages. In: Diekert, V. (ed.) Proceedings of a workshop of the ESPRIT BRA No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS) 1989, Technical University of Munich, pp. 172\u2013182 (1990)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:34Z","timestamp":1619492614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11753728_25","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}