{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:00:34Z","timestamp":1725487234598},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727323"},{"type":"electronic","value":"9783540727347"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72734-7_5","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T09:40:50Z","timestamp":1183023650000},"page":"54-68","source":"Crossref","is-referenced-by-count":6,"title":["Weighted Distributed Systems and Their Logics"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Ingmar","family":"Meinecke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Proceedings of LICS 2005","author":"C. Baier","year":"2005","unstructured":"Baier, C., Gr\u00f6\u00dfer, M.: Recognizing omega-regular languages with probabilistic automata. In: Proceedings of LICS 2005, IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"5_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":"5_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"5","author":"J. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.: Weak second order arithmetic and finite automata. Z. Math. Logik, Grundlag. Math.\u00a05, 66\u201372 (1960)","journal-title":"Z. Math. Logik, Grundlag. Math."},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0097-8493(93)90079-O","volume":"17","author":"K. Culik","year":"1993","unstructured":"Culik, K., Kari, J.: Image compression using weighted finite automata. Computer and Graphics\u00a017(3), 305\u2013313 (1993)","journal-title":"Computer and Graphics"},{"volume-title":"The Book of Traces","year":"1995","key":"5_CR5","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"5_CR6","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. Inform. and Comp.\u00a0153, 47\u201380 (1999)","journal-title":"Inform. and Comp."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"1-2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00166-3","volume":"247","author":"M. Droste","year":"2000","unstructured":"Droste, M., Gastin, P., Kuske, D.: Asynchronous cellular automata for pomsets. Theoret. Comp. Sc.\u00a0247(1-2), 1\u201338 (2000)","journal-title":"Theoret. Comp. Sc."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11779148_6","volume-title":"Developments in Language Theory","author":"M. Droste","year":"2006","unstructured":"Droste, M., Rahonis, G.: Weighted automata and weighted logics on infinite words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 49\u201358. Springer, Heidelberg (2006)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.tcs.2006.08.025","volume":"366","author":"M. Droste","year":"2006","unstructured":"Droste, M., Vogler, H.: Weighted tree automata and weighted logics. Theoret. Comp. Sc.\u00a0366, 228\u2013247 (2006)","journal-title":"Theoret. Comp. Sc."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2307\/1993511","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc.\u00a098, 21\u201352 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"5_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01201811","volume":"29","author":"S. Jesi","year":"1996","unstructured":"Jesi, S., Pighizzini, G., Sabadini, N.: Probabilistic asynchronous automata. Mathematical Systems Theory\u00a029(1), 5\u201331 (1996)","journal-title":"Mathematical Systems Theory"},{"key":"5_CR13","series-title":"1","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/978-3-642-59136-5_9","volume-title":"Handbook of Formal Languages","author":"W. Kuich","year":"1997","unstructured":"Kuich, W.: Semirings and Formal Power Series. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. 1, pp. 609\u2013677. Springer, Heidelberg (1997)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/3-540-44618-4_38","volume-title":"CONCUR 2000 - Concurrency Theory","author":"D. Kuske","year":"2000","unstructured":"Kuske, D.: Emptiness is decidable for asynchronous cellular machines. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 536\u2013551. Springer, Heidelberg (2000)"},{"key":"5_CR15","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":"5_CR16","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":"5_CR17","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)"},{"issue":"2","key":"5_CR18","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023(2), 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"key":"5_CR19","first-page":"56","volume":"27","author":"E. Ochma\u0144ski","year":"1985","unstructured":"Ochma\u0144ski, E.: Regular behaviour of concurrent systems. Bulletin of the EATCS\u00a027, 56\u201367 (1985)","journal-title":"Bulletin of the EATCS"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-540-24611-4_13","volume-title":"Validation of Stochastic Systems","author":"P. Schnoebelen","year":"2004","unstructured":"Schnoebelen, P.: The verification of probabilistic lossy channel systems. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.\u00a02925, pp. 445\u2013465. Springer, Heidelberg (2004)"},{"key":"5_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":"5_CR22","doi-asserted-by":"crossref","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications\u00a021 (1987)","DOI":"10.1051\/ita\/1987210200991"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72734-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:01:30Z","timestamp":1558274490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72734-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540727323","9783540727347"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72734-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}