{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:18:00Z","timestamp":1725560280297},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281931"},{"type":"electronic","value":"9783540318736"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11537311_46","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:00:06Z","timestamp":1127815206000},"page":"528-539","source":"Crossref","is-referenced-by-count":3,"title":["On the Expressiveness of Asynchronous Cellular Automata"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","volume-title":"Proceedings of LICS 1993","author":"P.A. Abdulla","year":"1993","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: Proceedings of LICS 1993. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-28644-8_10","volume-title":"Proceedings of CONCUR 2004","author":"B. Bollig","year":"2004","unstructured":"Bollig, B., Leucker, M.: Message-Passing Automata are expressively equivalent to EMSO Logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 146\u2013160. Springer, Heidelberg (2004)"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM\u00a030(2) (1983)","DOI":"10.1145\/322374.322380"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"C\u00e9c\u00e9, G., Finkel, A., Purushothaman Iyer, S.: Unreliable channels are easier to verify than perfect channels. Information and Computation\u00a0124(1) (1996)","DOI":"10.1006\/inco.1996.0003"},{"volume-title":"The Book of Traces","year":"1995","key":"46_CR5","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Droste, M., Gastin, P., Kuske, D.: Asynchronous cellular automata for pomsets. Theoretical Computer Science\u00a0247(1-2) (2000)","DOI":"10.1016\/S0304-3975(00)00166-3"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Finkel, A.: Decidability of the termination problem for completely specified protocols. Distributed Computing\u00a07(3) (1994)","DOI":"10.1007\/BF02277857"},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-540-30550-7_4","volume-title":"Proceedings of DLT 2004","author":"B. Genest","year":"2004","unstructured":"Genest, B., Muscholl, A., Kuske, D.: A Kleene theorem for a class of communicating automata with effective algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 30\u201348. Springer, Heidelberg (2004)"},{"key":"46_CR9","unstructured":"Hanf, W.P.: Model-theoretic methods in the study of elementary logic. In: The Theory of Models. North-Holland, Amsterdam (1965)"},{"key":"46_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-44612-5_36","volume-title":"Proceedings of MFCS 2000","author":"J.G. Henriksen","year":"2000","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Regular collections of message sequence charts. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, p. 405. Springer, Heidelberg (2000)"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1007\/3-540-44618-4_38","volume-title":"Proceedingsof CONCUR 2000","author":"D. Kuske","year":"2000","unstructured":"Kuske, D.: Emptiness is decidable for asynchronous cellular machines. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, p. 536. Springer, Heidelberg (2000)"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Matz, O., Schweikardt, N., Thomas, W.: The monadic quantifier alternation hierarchy over grids and graphs. Information and Computation\u00a0179(2) (2002)","DOI":"10.1006\/inco.2002.2955"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Potthoff, A., Seibert, S., Thomas, W.: Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bulletin of the Belgian Mathematical Society\u00a01 (1994)","DOI":"10.36045\/bbms\/1103408550"},{"key":"46_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"W. Thomas","year":"1991","unstructured":"Thomas, W.: On Logics, Tilings, and Automata. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510. Springer, Heidelberg (1991)"},{"key":"46_CR15","unstructured":"Thomas, W.: Elements of an automata theory over partial orders. In: Proceedings of POMIV 1996. DIMACS, vol.\u00a029, AMS (1996)"},{"key":"46_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030586","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Automata theory on trees and partial orders. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214. Springer, Heidelberg (1997)"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Wies\u0142aw Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications, 21 (1987)","DOI":"10.1051\/ita\/1987210200991"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537311_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T18:44:59Z","timestamp":1586457899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537311_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281931","9783540318736"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11537311_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}