{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:08:31Z","timestamp":1776942511227,"version":"3.51.4"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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":8751,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1016\/0890-5401(89)90051-5","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"135-150","source":"Crossref","is-referenced-by-count":31,"title":["Membership problems for regular and context-free trace languages"],"prefix":"10.1016","volume":"82","author":[{"given":"A.","family":"Bertoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Mauri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Sabadini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90051-5_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":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90051-5_BIB2","author":"Aigner","year":"1979"},{"key":"10.1016\/0890-5401(89)90051-5_BIB3","first-page":"205","article-title":"An application of the theory of partially commutative monoids: Asymptotic densities of trace languages","volume":"Vol. 118","author":"Bertoni","year":"1981"},{"key":"10.1016\/0890-5401(89)90051-5_BIB4","series-title":"Proceedings, Second World Conference on Mathematics at the Service of Men","first-page":"146","article-title":"A hierarchy of regular trace languages and some combinatorial applications","author":"Bertoni","year":"1982"},{"key":"10.1016\/0890-5401(89)90051-5_BIB5","series-title":"Proceedings, 9th ICALP","first-page":"61","article-title":"Equivalence and membership problems for regular trace languages","volume":"Vol. 140","author":"Bertoni","year":"1982"},{"key":"10.1016\/0890-5401(89)90051-5_BIB6","article-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements","volume":"Vol. 85","author":"Cartier","year":"1969"},{"key":"10.1016\/0890-5401(89)90051-5_BIB7","series-title":"Control Flow and Data Flow: Concepts of Distributed Programming","first-page":"7","article-title":"Distributed systems, partial orderings of events and event structures","volume":"Vol. 14","author":"Degano","year":"1985"},{"key":"10.1016\/0890-5401(89)90051-5_BIB8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math."},{"key":"10.1016\/0890-5401(89)90051-5_BIB9","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0890-5401(89)90051-5_BIB10","author":"Garey","year":"1979"},{"key":"10.1016\/0890-5401(89)90051-5_BIB11","author":"Gischer","year":"1984"},{"key":"10.1016\/0890-5401(89)90051-5_BIB12","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0890-5401(89)90051-5_BIB13","article-title":"Petri nets and regular trace languages","author":"Knuth","year":"1978"},{"key":"10.1016\/0890-5401(89)90051-5_BIB14","first-page":"298","article-title":"Synthesis of concurrent schemes","volume":"Vol. 64","author":"Janicki","year":"1978"},{"key":"10.1016\/0890-5401(89)90051-5_BIB15","author":"Lallement","year":"1979"},{"key":"10.1016\/0890-5401(89)90051-5_BIB16","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/0890-5401(89)90051-5_BIB17","first-page":"353","article-title":"Semantics of concurrent systems: A modular fixed point trace approach","volume":"Vol. 188","author":"Mazurkiewicz","year":"1985"},{"key":"10.1016\/0890-5401(89)90051-5_BIB18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","article-title":"Petri nets, event structures and domains","volume":"13","author":"Nielsen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90051-5_BIB19","first-page":"56","article-title":"Regular behaviour of concurrent systems","volume":"27","author":"Ochmanski","year":"1985","journal-title":"EATCS Bull."},{"key":"10.1016\/0890-5401(89)90051-5_BIB20","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(89)90051-5_BIB21","author":"Petri","year":"1977"},{"issue":"No. 1","key":"10.1016\/0890-5401(89)90051-5_BIB22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","article-title":"Modeling concurrency with partial orders","volume":"15","author":"Pratt","year":"1986","journal-title":"Int. J. Parallel Programming"},{"key":"10.1016\/0890-5401(89)90051-5_BIB23","first-page":"117","article-title":"Some properties of trace languages","volume":"7","author":"Rytter","year":"1984","journal-title":"Fund. Inform."},{"key":"10.1016\/0890-5401(89)90051-5_BIB24","first-page":"531","article-title":"Trace languages and closure operations","volume":"4","author":"Szijarto","year":"1981","journal-title":"Fund. Inform."},{"key":"10.1016\/0890-5401(89)90051-5_BIB25","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","article-title":"General context free recognition in less than cubic time","volume":"10","author":"Valiant","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(89)90051-5_BIB26","series-title":"Proceedings Advanced Course on Petri nets","article-title":"Event structures","volume":"Vol. 255","author":"Winskel","year":"1986"},{"key":"10.1016\/0890-5401(89)90051-5_BIB27","first-page":"99","article-title":"Notes an asynchronous automata","volume":"21","author":"Zielonka","year":"1987","journal-title":"RAIRO"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900515?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900515?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:26:53Z","timestamp":1549045613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0890540189900515"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90051-5","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}