{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:25:50Z","timestamp":1767929150957,"version":"3.49.0"},"reference-count":32,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"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":9024,"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":[[1988,11]]},"DOI":"10.1016\/0304-3975(88)90124-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"199-224","source":"Crossref","is-referenced-by-count":127,"title":["The equational theory of pomsets"],"prefix":"10.1016","volume":"61","author":[{"given":"Jay L.","family":"Gischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90124-7_BIB1","series-title":"Proc. Symp. on Semantics of Concurrent Computation","first-page":"21","article-title":"Modal logic of concurrent nondeterministic programs","volume":"70","author":"Abrahamson","year":"1979"},{"key":"10.1016\/0304-3975(88)90124-7_BIB2","series-title":"Programming Languages Group Memo No. 79-01","article-title":"Relations of flow languages to Petri net languages","author":"Araki","year":"1979"},{"key":"10.1016\/0304-3975(88)90124-7_BIB3","series-title":"Net Theory and Applications","volume":"84","year":"1980"},{"key":"10.1016\/0304-3975(88)90124-7_BIB4","series-title":"Formalization of Programming Concepts","first-page":"252","article-title":"Scenarios: a model of nondeterministic computation","volume":"107","author":"Brock","year":"1981"},{"issue":"3","key":"10.1016\/0304-3975(88)90124-7_BIB5","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90124-7_BIB6","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"issue":"9","key":"10.1016\/0304-3975(88)90124-7_BIB7","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/358746.358767","article-title":"Shuffle languages, Petri nets, and context-sensitive languages","volume":"24","author":"Gischer","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(88)90124-7_BIB8","series-title":"Tech. Rept. No. STAN-CS-84-7033","article-title":"Partial orders and the axiomatic theory of shuffle","author":"Gischer","year":"1984"},{"issue":"2","key":"10.1016\/0304-3975(88)90124-7_BIB9","first-page":"427","article-title":"On partial languages","volume":"IV","author":"Grabowski","year":"1981","journal-title":"Ann. Soc. Math. Polon. Ser. IV. Fund. Math."},{"key":"10.1016\/0304-3975(88)90124-7_BIB10","series-title":"Ph.D. Thesis","article-title":"Semantics of communicating parallel processes","author":"Greif","year":"1975"},{"key":"10.1016\/0304-3975(88)90124-7_BIB11","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0304-3975(88)90124-7_BIB12","series-title":"Proc. IFIP 74","first-page":"661","article-title":"A complete axiom system of super-regular expressions","author":"Ito","year":"1974"},{"key":"10.1016\/0304-3975(88)90124-7_BIB13","series-title":"Proc. Conf. on Information Sciences and Systems","article-title":"On behaviors of parallel processes with duration","author":"Ito","year":"1985"},{"issue":"2","key":"10.1016\/0304-3975(88)90124-7_BIB14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(81)90054-2","article-title":"The power of synchronizing operations on strings","volume":"14","author":"Jantzen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90124-7_BIB15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(85)90221-X","article-title":"Extending regular expressions with iterated shuffle","volume":"38","author":"Jantzen","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90124-7_BIB16","series-title":"Proc. IFIP 77","first-page":"993","article-title":"Coroutines and networks of parallel processes","author":"Kahn","year":"1977"},{"key":"10.1016\/0304-3975(88)90124-7_BIB17","first-page":"92","article-title":"An algebraic system for process structuring and interprocess communication","author":"Kimura","year":"1976","journal-title":"Proc. 8th Ann. Symp. on Theory of Computing"},{"issue":"7","key":"10.1016\/0304-3975(88)90124-7_BIB18","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0304-3975(88)90124-7_BIB19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/5383.5384","article-title":"The mutual exclusion problem: Part I\u2014A theory of interprocess communication","volume":"33","author":"Lamport","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90124-7_BIB20","article-title":"A Calculus of Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(88)90124-7_BIB21","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","article-title":"A complete inference system for a class of regular behaviours","volume":"28","author":"Milner","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90124-7_BIB22","first-page":"213","article-title":"On the composition of processes","author":"Pratt","year":"1982","journal-title":"Proc. 9th Ann. Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(88)90124-7_BIB23","series-title":"Proc. Conf. on Logics of Programs","first-page":"267","article-title":"Some constructions for order-theoretic models of concurrency","volume":"193","author":"Pratt","year":"1985"},{"key":"10.1016\/0304-3975(88)90124-7_BIB24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","article-title":"Modelling concurrency with partial orders","volume":"15","author":"Pratt","year":"1987","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/0304-3975(88)90124-7_BIB25","first-page":"120","article-title":"On defining relations for the algebra of regular events","volume":"16","author":"Redko","year":"1964","journal-title":"Ukrain. Mat. \u017d"},{"issue":"1","key":"10.1016\/0304-3975(88)90124-7_BIB26","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","article-title":"Two complete axiom systems for the algebra of regular events","volume":"13","author":"Salomaa","year":"1966","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0304-3975(88)90124-7_BIB27","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TSE.1978.231501","article-title":"Software description with flow expressions","volume":"SE-4","author":"Shaw","year":"1978","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/0304-3975(88)90124-7_BIB28","first-page":"601","article-title":"Descriptional complexity of concurrent processes","volume":"88","author":"Slutzki","year":"1980"},{"issue":"2","key":"10.1016\/0304-3975(88)90124-7_BIB29","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series parallel digraphs","volume":"11","author":"Valdes","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90124-7_BIB30","series-title":"Ph.D. Thesis","article-title":"Events in computation","author":"Winskel","year":"1980"},{"key":"10.1016\/0304-3975(88)90124-7_BIB31","first-page":"246","article-title":"Categories of models for concurrency","volume":"197","author":"Winskel","year":"1985"},{"key":"10.1016\/0304-3975(88)90124-7_BIB32","series-title":"Tech. Rept. No. STAN-CS-71-214","article-title":"Complements and transitive closures","author":"Graham","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901247?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901247?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:46Z","timestamp":1555113286000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":32,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["0304397588901247"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90124-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}