{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:48:40Z","timestamp":1768286920583,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7382,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/0304-3975(93)90209-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"35-54","source":"Crossref","is-referenced-by-count":7,"title":["On the concatenation of infinite traces"],"prefix":"10.1016","volume":"113","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90209-C_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","article-title":"Theory of traces","volume":"60","author":"Aalbersberg","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90209-C_BIB2","series-title":"Proc. ASMICS workshop on Free Partially Commutative Monoids","first-page":"1","article-title":"About infinite traces","author":"Bonizzoni","year":"1990"},{"key":"10.1016\/0304-3975(93)90209-C_BIB3","series-title":"General Topology","author":"Bourbaki","year":"1968"},{"key":"10.1016\/0304-3975(93)90209-C_BIB4","first-page":"241","article-title":"Partial commutations and faithful rational transductions","volume":"35","author":"Clerbout","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90209-C_BIB5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","article-title":"Automates et commutations partielles","volume":"19","author":"Cori","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(93)90209-C_BIB6","article-title":"Combinatorics on Traces","volume":"Vol. 454","author":"Diekert","year":"1990"},{"key":"10.1016\/0304-3975(93)90209-C_BIB7","first-page":"105","article-title":"On the concatenation of infinite traces","volume":"Vol. 480","author":"Diekert","year":"1991"},{"key":"10.1016\/0304-3975(93)90209-C_BIB8","first-page":"131","article-title":"Recognizable complex trace languages","volume":"Vol. 520","author":"Diekert","year":"1991"},{"key":"10.1016\/0304-3975(93)90209-C_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90206-3","article-title":"Maximal serializability of iterated transactions","volume":"38","author":"Fl\u00e9","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90209-C_BIB10","first-page":"277","article-title":"Infinite traces","volume":"Vol. 469","author":"Gastin","year":"1990"},{"key":"10.1016\/0304-3975(93)90209-C_BIB11","first-page":"89","article-title":"Recognizable and rational trace languages of finite and infinite traces","volume":"Vol. 480","author":"Gastin","year":"1991"},{"key":"10.1016\/0304-3975(93)90209-C_BIB12","series-title":"Technical Report","article-title":"The poset of infinitary traces","author":"Gastin","year":"1991"},{"key":"10.1016\/0304-3975(93)90209-C_BIB13","first-page":"266","article-title":"Infinitary languages: basic theory and applications to concurrent systems","volume":"Vol. 242","author":"Hoogeboom","year":"1986"},{"key":"10.1016\/0304-3975(93)90209-C_BIB14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(90)90061-2","article-title":"A metric for traces","volume":"35","author":"Kwiatkowska","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90209-C_BIB15","series-title":"DAIMI Report PB 78","article-title":"Concurrent program schemes and their interpretations","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/0304-3975(93)90209-C_BIB16","first-page":"279","article-title":"Trace theory","volume":"Vol. 255","author":"Mazurkiewicz","year":"1987"},{"key":"10.1016\/0304-3975(93)90209-C_BIB17","first-page":"637","article-title":"Partial commutations","volume":"Vol. 372","author":"Perrin","year":"1989"},{"key":"10.1016\/0304-3975(93)90209-C_BIB18","article-title":"Mots Infinis","volume":"6","author":"Perrin","year":"1991"},{"key":"10.1016\/0304-3975(93)90209-C_BIB19","first-page":"249","article-title":"Adequate path expressions","volume":"Vol. 70","author":"Shields","year":"1979"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390209C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390209C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:22:51Z","timestamp":1555129371000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390209C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["030439759390209C"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90209-c","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}