{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:06:12Z","timestamp":1794341172248,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648963","type":"print"},{"value":"9783540684558","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055645","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T03:31:00Z","timestamp":1153971060000},"page":"517-532","source":"Crossref","is-referenced-by-count":8,"title":["Asynchronous cellular automata and asynchronous automata for pomsets"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Kuske","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","DOI":"10.1142\/2563","volume-title":"The Book of Traces","author":"V. Diekert","year":"1995","unstructured":"V. Diekert, A. Muscholl: Construction of asynchronous automata. Chapter 8 of [3]."},{"key":"34_CR2","unstructured":"M. Droste, P. Gastin: Asynchronous cellular automata and logic for pomsets without auto-concurrency. To appear, 1997. Extended abstract appeared as Asynchronous cellular automata for pomsets without auto-concurrency. In: CONCUR 96. Lecture Notes in Computer Science 1119, pp. 627\u2013638, 1996."},{"key":"34_CR3","volume-title":"The Book of Traces","year":"1995","unstructured":"V. Diekert, G. Rozenberg (eds.): The Book of Traces. World Scientific, Singapore, 1995."},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J.L. Gischer","year":"1988","unstructured":"J.L. Gischer: The equational theory of pomsets. Theoretical Computer Science 61 (1988), pp. 199\u2013224.","journal-title":"Theoretical Computer Science"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"N. Klarlund, M. Mukund, M. A. Sohoni: Determinizing asynchronous automata.In: ICALP'94 (S. Abiteboul, E. Shamir, eds.), Lecture Notes in Computer Science 820, pp. 130\u2013141, 1994.","DOI":"10.1007\/3-540-58201-0_63"},{"key":"34_CR6","unstructured":"D. Kuske: Acceptance modes for asynchronous cellular automata for pomsets. http:\/\/www.math.tu-dresden.de\/~kuske\/abstracts\/aca.html, 1997."},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz: Concurrent program schemes and their interpretation. Tech. rep. DAIMI PB 78, Aarhus University, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz: Trace Theory. In: Advances in Petri Nets 86 (W. Brauer et al., eds.), Lecture Notes in Computer Science 255, pp. 279\u2013324, 1987.","DOI":"10.1007\/3-540-17906-2_30"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"O. Matz, W. Thomas: The monadic quantifier alternation hierarchy over graphs is infinite. In: Proc. LICS 1997, pp. 236\u2013244.","DOI":"10.1109\/LICS.1997.614951"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V.R. Pratt","year":"1987","unstructured":"V.R. Pratt: Modelling concurrency with partial orders. J. of Parallel Programming 15 (1987), pp. 33\u201371.","journal-title":"J. of Parallel Programming"},{"key":"34_CR11","unstructured":"W. Thomas: On logical definability of trace languages. In: Proc. of the workshop Algebraic Methods in Computer Science, Kochel am See, FRG (1989) (V. Diekert, ed.). Report TUM-I9002, TU Munich, 1990, pp. 172\u2013182."},{"key":"34_CR12","unstructured":"W. Thomas: Languages, Automata, and Logic. In: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.) Springer Verlag (to appeal). For a preliminary version see: Rep. 9607, Inst. f. Informatik u. Prakt. Math., Universit\u00e4t Kiel, 1996."},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"W. Thomas: Automata theory on trees and partial orders. In: TAPSOFT 97 (M. Bidoit, M. Dauchet, eds.), Lecture Notes in Computer Science 1214, pp. 20\u201338, 1997.","DOI":"10.1007\/BFb0030586"},{"key":"34_CR14","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"W. Zielonka: Notes on finite asynchronous automata. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications 21 (1987), pp. 99\u2013135.","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"W. Zielonka: Safe executions of recognizable trace languages by asynchronous automata. In: Logical Foundations of Computer Science (A.R. Meyer et al., eds.), Lecture Notes in Computer Science 363, pp. 278\u2013289, 1989.","DOI":"10.1007\/3-540-51237-3_22"},{"key":"34_CR16","volume-title":"The Book of Traces","author":"W. Zielonka","year":"1995","unstructured":"W. Zielonka: Asynchronous automata. Chapter 7 of [3]."}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T04:29:21Z","timestamp":1555734561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0055645","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0055611","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}