{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:10Z","timestamp":1725663190777},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_89","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:59:05Z","timestamp":1330203545000},"page":"418-430","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterization of recognizable trace languages by distributed automata"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Petit","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"37_CR1","unstructured":"AALBERSBERG IJ. J. and ROZENBERG G., \"Theory of traces\", Tech. Rep. no 86\u201316, University of Leiden (Holland)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"BERTONI A., MAURI G. and SABADANI N., (1) \"Equivalence and menbership problems for regular trace languages\", L.N.C.S. 140, (1982)","DOI":"10.1007\/BFb0012757"},{"key":"37_CR3","unstructured":"\"Context-free trace languages\", Proc. 7th CAAP Lille (France) (1982)"},{"key":"37_CR4","unstructured":"\"Unambiguous regular trace languages\", Proc. Col. on Alg., Combinat. and Comp. Science, Gyor (1983)"},{"key":"37_CR5","unstructured":"BRUSCHI D., PIGHIZZINI G. and SABADINI N., \"On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languages\", STACS 1988, L.N.C.S. 294, (1988)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"CARTIER P. and FOATA D., \"Probl\u00e8mes combinatories de commutation et de r\u00e9arrangements\", Lectures Notes in Mathematics 85, (1969)","DOI":"10.1007\/BFb0079468"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"CLERBOUT M. and LATTEUX M., \"Partial commutations and faithful rational transductions\", T.C.S. 34, (1984)","DOI":"10.1016\/0304-3975(84)90053-7"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"CORI R., LATTEUX M., ROOS Y. and SOPENA E., \"2-asynchronous automata\", T.C.S. 61, (1988)","DOI":"10.1016\/0304-3975(88)90110-7"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"CORI R. and METIVIER Y., (1) \"Recognizable subsets of some partially abelian monoids\", T.C.S. 35, (1984)","DOI":"10.1016\/0304-3975(85)90013-1"},{"key":"37_CR10","unstructured":"\"Approximation of a trace, asynchronous automata and the ordering of events in a distributed system\", ICALP 1988, L.N.C.S. 317 (1988)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"CORI R. and PERRIN D., \"Automates et commutations partielles\", R.A.I.R.O. Informatique Theorique, Vol. 19\u20131, (1983)","DOI":"10.1051\/ita\/1985190100211"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"DUBOC C., (1) \"Some properties of commutation in free partially commutative monoids\", Information Processing Letters 20, (1985)","DOI":"10.1016\/0020-0190(85)90121-8"},{"key":"37_CR13","unstructured":"\"Equations in free partially commutative monoids\", L.N.C.S. 210, (1986)"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"FLE M.P. and ROUCAIROL G., \"Maximal serializability of iterated transactions\", T.C.S. 38, (1985)","DOI":"10.1016\/0304-3975(85)90206-3"},{"key":"37_CR15","unstructured":"JANICKI R., \"Mazurkiewicz trace semantics for communicating sequential processes\", Proc. 5th European Workshop on Appl. and Theory of Petri Nets, Aarhus (Danemark) (1984)"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"MAZURKIEWICZ A., (1) \"Concurrent program schemes and their interpretations\", DAIMI Rep. PB-78, Aarhus University (Danemark) (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"37_CR17","unstructured":"\"Traces, histories, graphs: instances of a process monoid\", L.N.C.S. 176, (1984)"},{"key":"37_CR18","unstructured":"\"Semantics of concurrent systems: a modular fixed-point trace approach\", L.N.C.S. 188, (1985)"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"METIVIER Y., (1) \"On recognizable subsets of free partially commutative monoids\", T.C.S. 58, (1988)","DOI":"10.1016\/0304-3975(88)90027-8"},{"key":"37_CR20","unstructured":"\"An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs\", ICALP 1987, L.N.C.S. 267, (1987)"},{"key":"37_CR21","unstructured":"OCHMANSKI E., \"Regular behaviour of concurrent processes\", Bul. EATCS 27, (1985)"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"PERRIN D., \"Words over a partially commutative alphabet\", NATO ASI F12 (1985)","DOI":"10.1007\/978-3-642-82456-2_23"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"PETIT A., (1) \"Characterization of recognizable trace languages by distributed automata\", Tech. Rep. no89-1, Univ. of Orl\u00e9ans and no465, Univ. of Paris 11 (France)","DOI":"10.1007\/BF01200264"},{"key":"37_CR24","unstructured":"\"A deterministic distribution algorithms\", Tech. Rep. no88\u201310, Univ. of Orleans and no461, Univ. of Paris 11 (France)"},{"key":"37_CR25","unstructured":"ROZOY B., \"Le th\u00e9or\u00e8me de Zielonka...encore!\", Tech. Rep. no87\u201352, University of Paris 7, (France)"},{"key":"37_CR26","unstructured":"SAKAROVITCH J., \"On regular trace languages\", to appear in T.C.S."},{"key":"37_CR27","doi-asserted-by":"crossref","unstructured":"ZIELONKA W., Notes on finite asynchronous automata, R.A.I.R.O. Informatique th\u00e9orique et applications, Vol. 21\u20132, p. 99\u2013135 (1987)","DOI":"10.1051\/ita\/1987210200991"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T10:19:15Z","timestamp":1561371555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"25 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}