{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:16Z","timestamp":1725664096010},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600299"},{"type":"electronic","value":"9783540494089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60029-9_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:31:14Z","timestamp":1330277474000},"page":"357-373","source":"Crossref","is-referenced-by-count":0,"title":["Subclasses of recognizable trace languages"],"prefix":"10.1007","author":[{"given":"Henning","family":"Reineke","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I. J. Aalbersberg","year":"1988","unstructured":"Aalbersberg, I. J., Rozenberg, G.: Theory of Traces, Theoretical Computer Science 60 (1988) 1\u201382","journal-title":"Theoretical Computer Science"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Diekert, V.: Combinatorics on Traces, LNCS 454, Springer-Verlag 1990","DOI":"10.1007\/3-540-53031-2"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(86)90094-0","volume":"48","author":"C. Duboc","year":"1986","unstructured":"Duboc, Chr.: Mixed Product and Asynchronous Automata, Theoretical Computer Science 48 (1986) 183\u2013199","journal-title":"Theoretical Computer Science"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent Program Schemes and Their Interpretations, DAIMI-PB-78, Aarhus University 1977","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Trace Theory, in: Advanced Course in Petri Nets 1986, Vol. 2, LNCS 255 279\u2013324, Springer-Verlag 1987","DOI":"10.1007\/3-540-17906-2_30"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on Finite Asynchronous Automata, Theoretical Informatics and Applications 21 (1987) 99\u2013135","journal-title":"Theoretical Informatics and Applications"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Zielonka, W.: Safe Executions of Recognizable Trace Languages by Asynchronous Automata, in: Logic at Botik 1989, LNCS 363 278\u2013289, Springer-Verlag 1989","DOI":"10.1007\/3-540-51237-3_22"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60029-9_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:28:12Z","timestamp":1605648492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60029-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600299","9783540494089"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-60029-9_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}