{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:02:48Z","timestamp":1765666968525},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512370"},{"type":"electronic","value":"9783540461807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51237-3_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:48:46Z","timestamp":1330184926000},"page":"278-289","source":"Crossref","is-referenced-by-count":21,"title":["Safe executions of recognizable trace languages by asynchronous automata"],"prefix":"10.1007","author":[{"given":"Wies\u0142aw","family":"Zielonka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"R.Cori, Y.Metivier, Approximation of a trace, asynchronous automata and the ordering of events in a distributed system, 15 ICALP, LNCS 317,147\u2013161. Springer Verlag, 1988","DOI":"10.1007\/3-540-19488-6_113"},{"key":"22_CR2","unstructured":"R. Cori, Y. Metivier, W. Zielonka, Applications of trace approximation to asynchronous automata and message passing with bounded time-stamps in asynchronous networks, in preparation"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(86)90094-0","volume":"48","author":"C. Duboc","year":"1986","unstructured":"C. Duboc, Mixed product and asynchronous automata, Theor. Comp. Sci., 48 (1986),183\u2013199","journal-title":"Theor. Comp. Sci."},{"key":"22_CR4","unstructured":"S. Eilenberg, Automata, Languages and Machines, vol. A, 1974, Academic Press"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Amos Israeli, Ming Li, Bounded Time-Stamps, Proceedings of 28th Annual FOCS Symposium,1987,371\u2013382","DOI":"10.1109\/SFCS.1987.10"},{"key":"22_CR6","unstructured":"G. Lallement, Semigroups and Combinatorial Applications, 1979, J. Wiley and Sons"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Concurrent Program Schemes and Their Interpretations, DAIMI-PB-78, Aarchus University, 1977","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"22_CR8","unstructured":"Y. Metivier, An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs, 14 ICALP, LNCS 267"},{"key":"22_CR9","first-page":"56","volume":"27","author":"E. Ochmanski","year":"1985","unstructured":"E. Ochmanski, Regular Behaviour of Concurrent Schemes, EATCS Bulletin, vol. 27,1985,56\u201367","journal-title":"EATCS Bulletin"},{"issue":"2","key":"22_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"W. Zielonka, Notes on Finite Asynchronous Automata, RAIRO Inf. Theor. et Appl., 21 (2), 1987, 99\u2013135","journal-title":"RAIRO Inf. Theor. et Appl."}],"container-title":["Lecture Notes in Computer Science","Logic at Botik '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51237-3_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:20:21Z","timestamp":1605630021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51237-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512370","9783540461807"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51237-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}