{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:55:55Z","timestamp":1725584155555},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212536"},{"type":"electronic","value":"9783642212543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21254-3_24","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T09:38:04Z","timestamp":1306489084000},"page":"310-322","source":"Crossref","is-referenced-by-count":3,"title":["Models for Quantitative Distributed Systems and Multi-Valued Logics"],"prefix":"10.1007","author":[{"given":"Martin","family":"Huschenbett","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-02737-6_2","volume-title":"Developments in Language Theory","author":"B. Bollig","year":"2009","unstructured":"Bollig, B., Gastin, P.: Weighted versus probabilistic logics. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 18\u201338. Springer, Heidelberg (2009)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-72734-7_5","volume-title":"Logical Foundations of Computer Science","author":"B. Bollig","year":"2007","unstructured":"Bollig, B., Meinecke, I.: Weighted distributed systems and their logics. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 54\u201368. Springer, Heidelberg (2007)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschr. f. math. Logik und Grundlagen d. Math.\u00a06, 66\u201392 (1960)","journal-title":"Zeitschr. f. math. Logik und Grundlagen d. Math."},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-59126-6_8","volume-title":"Handbook of Formal Languages","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, vol.\u00a03, pp. 457\u2013533. Springer, Heidelberg (1997)"},{"volume-title":"The Book of Traces","year":"1995","key":"24_CR6","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scienific Publishing, Singapore (1995)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. In: [8], ch. 5, pp. 175\u2013211","DOI":"10.1007\/978-3-642-01492-5_5"},{"volume-title":"Handbook of Weighted Automata","year":"2009","key":"24_CR8","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-61377-3_41","volume-title":"Computer Science Logic","author":"M. Droste","year":"1996","unstructured":"Droste, M., Kuske, D.: Languages and logical definability in concurrency monoids. In: Kleine B\u00fcning, H. (ed.) CSL 1995. LNCS, vol.\u00a01092, pp. 233\u2013251. Springer, Heidelberg (1996)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-15155-2_47","volume-title":"Mathematical Foundations of Computer Science 2010","author":"M. Droste","year":"2010","unstructured":"Droste, M., Meinecke, I.: Describing average- and longtime-behavior by weighted MSO logics. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 537\u2013548. Springer, Heidelberg (2010)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"3481","DOI":"10.1016\/j.tcs.2009.03.029","volume":"410","author":"M. Droste","year":"2009","unstructured":"Droste, M., Rahonis, G.: Weighted automata and weighted logics with discounting. Theoretical Computer Science\u00a0410, 3481\u20133494 (2009)","journal-title":"Theoretical Computer Science"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-14455-4_16","volume-title":"Developments in Language Theory","author":"M. Droste","year":"2010","unstructured":"Droste, M., Vogler, H.: Kleene and B\u00fcchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 160\u2013172. Springer, Heidelberg (2010)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(95)00130-1","volume":"154","author":"W. Ebinger","year":"1996","unstructured":"Ebinger, W., Muscholl, A.: Logical definability on infinite traces. Theoretical Computer Science\u00a0154, 67\u201384 (1996)","journal-title":"Theoretical Computer Science"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Fichtner, I., Kuske, D., Meinecke, I.: Traces, series-parallel posets, and pictures: A weighted study. In: [8], ch. 10, pp. 397\u2013441","DOI":"10.1007\/978-3-642-01492-5_10"},{"key":"24_CR15","first-page":"147","volume":"80","author":"B. Genest","year":"2007","unstructured":"Genest, B., Kuske, D., Muscholl, A.: On communicating automata with bounded channels. Fundamenta Informaticae\u00a080, 147\u2013167 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Huschenbett, M.: Models for quantitative distributed systems and multi-valued logics. Master\u2019s thesis, Universit\u00e4t Leipzig (2010)","DOI":"10.1007\/978-3-642-21254-3_24"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Huschenbett, M.: A Kleene-Sch\u00fctzenberger theorem for trace series over bounded lattices (2011) (submitted journal version)","DOI":"10.3233\/FI-2011-586"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 199\u2013213. Springer, Heidelberg (2007)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2006.11.031","volume":"374","author":"D. Kuske","year":"2007","unstructured":"Kuske, D.: Weighted asynchronous cellular automata. Theoretical Computer Science\u00a0374, 127\u2013148 (2007)","journal-title":"Theoretical Computer Science"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11753728_25","volume-title":"Computer Science \u2013 Theory and Applications","author":"I. Meinecke","year":"2006","unstructured":"Meinecke, I.: Weighted logics for traces. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 235\u2013246. Springer, Heidelberg (2006)"},{"key":"24_CR21","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":"24_CR22","unstructured":"Thomas, W.: On logical definability of trace languages. In: ASMICS-Workshop \u201cFree Partially Commutative Monoids\u201d. Rep. TUM-I9002, TU M\u00fcnchen, pp. 172\u2013182 (1990)"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Zielonka, W.: Asynchronous automata. In: [6], ch. 7, pp. 205\u2013247","DOI":"10.1142\/9789814261456_0007"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21254-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T17:36:23Z","timestamp":1592588183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}