{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T02:49:19Z","timestamp":1777690159474,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":4184,"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":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00442-4","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"225-248","source":"Crossref","is-referenced-by-count":7,"title":["Axiomatizing the subsumption and subword preorders on finite and infinite partial words"],"prefix":"10.1016","volume":"273","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00442-4_BIB1","first-page":"1","article-title":"Full abstraction for series\u2013parallel pomsets","volume":"Vol. 493","author":"Aceto","year":"1991"},{"key":"10.1016\/S0304-3975(00)00442-4_BIB2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(94)00046-8","article-title":"Denotational semantics in the cpo and metric approach","volume":"135","author":"Baier","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","article-title":"Partial words and a theorem of Fine and Wilf","volume":"218","author":"Berstel","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB4","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0022-0000(76)80030-X","article-title":"Varieties of ordered algebras","volume":"13","author":"Bloom","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB5","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0304-3975(00)00040-2","article-title":"Long words","volume":"259","author":"Bloom","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1051\/ita\/1998324-601751","article-title":"Shuffle binoids","volume":"32","author":"Bloom","year":"1988","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB7","first-page":"21","article-title":"Metric pomset semantics for a concurrent language with recursion","volume":"Vol. 469","author":"de Bakker","year":"1990"},{"key":"10.1016\/S0304-3975(00)00442-4_BIB8","first-page":"123","article-title":"On the semantics of concurrency","volume":"Vol. 249","author":"Boudol","year":"1987"},{"key":"10.1016\/S0304-3975(00)00442-4_BIB9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","article-title":"The equational theory of pomsets","volume":"61","author":"Gischer","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB10","first-page":"427","article-title":"On partial languages","volume":"4","author":"Grabowski","year":"1981","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB11","first-page":"555","article-title":"Series\u2013parallel posets","volume":"Vol. 1373","author":"Lodaya","year":"1998"},{"key":"10.1016\/S0304-3975(00)00442-4_BIB12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","article-title":"Series\u2013parallel languages and the bounded width property","volume":"237","author":"Lodaya","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB13","first-page":"577","article-title":"Concurrency, modularity and synchronization","volume":"Vol. 379","author":"Mazurkiewicz","year":"1989"},{"key":"10.1016\/S0304-3975(00)00442-4_BIB14","first-page":"360","article-title":"Pomset semantics for true concurrency with synchronization and recursion","volume":"Vol. 379","author":"Meyer","year":"1989"},{"key":"10.1016\/S0304-3975(00)00442-4_BIB15","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 Process."},{"issue":"2","key":"10.1016\/S0304-3975(00)00442-4_BIB16","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series\u2013parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB17","doi-asserted-by":"crossref","unstructured":"Th. Wilke, An Eilenberg theorem for \u221e-languages, in: ICALP\u201991, Lecture Notes in Computer Science, Vol. 510, 1991, pp. 588\u2013599.","DOI":"10.1007\/3-540-54233-7_166"},{"key":"10.1016\/S0304-3975(00)00442-4_BIB18","first-page":"406","article-title":"Algebraic characterization of Petri net pomset semantics","volume":"Vol. 1243","author":"Wimmel","year":"1997"},{"key":"10.1016\/S0304-3975(00)00442-4_BIB19","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(80)90004-3","article-title":"Behaviours of concurrent systems","volume":"12","author":"Winkowski","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB20","doi-asserted-by":"crossref","first-page":"403","DOI":"10.3233\/FI-1996-283413","article-title":"Concatenable weighted pomsets and their applications to modelling processes of Petri nets","volume":"28","author":"Winkowski","year":"1996","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(00)00442-4_BIB21","doi-asserted-by":"crossref","unstructured":"G. Winskel, Event structure semantics for CCS and related languages, in: ICALP\u201982, Lecture Notes in Computer Science, Vol. 140, Springer, Berlin, 1982, pp. 561\u2013576.","DOI":"10.1007\/BFb0012800"},{"key":"10.1016\/S0304-3975(00)00442-4_BIB22","first-page":"1","article-title":"Models for concurrency","volume":"Vol. 4","author":"Winskel","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004424?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004424?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T02:09:58Z","timestamp":1578449398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500004424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500004424"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00442-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}