{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:25:11Z","timestamp":1725488711732},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668367"},{"type":"electronic","value":"9783540466918"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46691-6_25","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:42:24Z","timestamp":1186692144000},"page":"316-328","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Series and Parallel Operations on Pomsets"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Okawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,6,9]]},"reference":[{"key":"25_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"TAPSOFT 91","author":"L. Aceto","year":"1991","unstructured":"L. Aceto. Full abstraction for series-parallel pomsets. In: TAPSOFT 91, LNCS 493, 1\u201325, Springer-Verlag, 1991. 316, 317"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(94)00046-8","volume":"135","author":"Ch. Baier","year":"1994","unstructured":"Ch. Baier and M. E. Majster-Cederbaum. Denotational semantics in the cpo and metric approach. Theoret. Comput. Sci., 135:171\u2013220, 1994. 316","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(95)00230-8","volume":"163","author":"S. L. Bloom","year":"1996","unstructured":"S. L. Bloom and Z. \u00c9sik. Free shuffle algebras in language varieties. Theoret. Comput. Sci., 163:55\u201398, 1996. 316, 317, 317, 317","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1051\/ita\/1998324-601751","volume":"32","author":"S. L. Bloom","year":"1998","unstructured":"S. L. Bloom and Z. \u00c9sik. Shuffle binoids. Theoret. Inform. Appl., 32:175\u2013198, 1998. 316, 317, 317, 319, 319, 321","journal-title":"Theoret. Inform. Appl."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(88)90096-5","volume":"59","author":"G. Boudol","year":"1988","unstructured":"G. Boudol and I. Castellani. Concurrency and atomicity. Theoret. Comput. Sci., 59:1988, 25\u201384. 316, 316, 317, 317","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-55511-0_18","volume-title":"MFPS 91","author":"B. Bloom","year":"1992","unstructured":"B. Bloom and M. Kwiatkowska. Trade-offs in true concurrency: Pomsets and Mazurkiewicz traces. In: MFPS 91, LNCS 598, 350\u2013375, Springer-Verlag, 1992. 316, 317"},{"key":"25_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-53479-2_2","volume-title":"Semantics of Systems of Concurrent Processes","author":"J. W. Bakker de","year":"1990","unstructured":"J. W. de Bakker and J. H. A. Warmerdam. Metric pomset semantics for a concurrent language with recursion. In: Semantics of Systems of Concurrent Processes, LNCS 469, 21\u201349, Springer-Verlag, 1990. 316, 317"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J. L. Gischer","year":"1988","unstructured":"J. L. Gischer. The equational theory of pomsets. Theoret. Comput. Sci., 61:199\u2013224, 1988. 316, 317","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR9","first-page":"427","volume":"4","author":"J. Grabowski","year":"1981","unstructured":"J. Grabowski. On partial languages. Fund. Inform., 4:427\u2013498, 1981. 316, 316, 317, 317, 317, 319, 321","journal-title":"Fund. Inform."},{"key":"25_CR10","volume-title":"Combinatorial Algorithms","author":"L. Kucera","year":"1990","unstructured":"L. Kucera. Combinatorial Algorithms. Adam Hilger, Bristol and Philadelphia, 1990. 326"},{"key":"25_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BFb0028590","volume-title":"STACS 98","author":"K. Lodaya","year":"1998","unstructured":"K. Lodaya and P. Weil. Series-parallel posets: algebra, automata and languages. In: STACS 98, LNCS 1373, 555\u2013565, Springer-Verlag, 1998. 316"},{"key":"25_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/3-540-51486-4_103","volume-title":"MFCS 89","author":"A. Mazurkiewicz","year":"1989","unstructured":"A. Mazurkiewicz. Concurrency, modularity and synchronization. In: MFCS 89, LNCS 379, 577\u2013598, Springer-Verlag, 1989. 316"},{"key":"25_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/3-540-51486-4_83","volume-title":"MFCS 89","author":"J.-J. Ch. Meyer","year":"1989","unstructured":"J.-J. Ch. Meyer and E. P. de Vink. Pomset semantics for true concurrency with synchronization and recursion. In: MFCS 89, LNCS 379, 360\u2013369, 1989. 316"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"V. Pratt. Modelingcon currency with partial orders. Internat. J. Parallel Processing, 15:33\u201371, 1986. 316, 317, 318","journal-title":"Internat. J. Parallel Processing"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1305\/ndjfl\/1040046090","volume":"37","author":"A. Rensink","year":"1996","unstructured":"A. Rensink. Algebra and theory of order-deterministic pomsets. Notre Dam J. Formal Logic, 37:283\u2013320, 1996. 316, 317","journal-title":"Notre Dam J. Formal Logic"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1017\/S0960129500000578","volume":"4","author":"S. T. Tschantz","year":"1994","unstructured":"S. T. Tschantz. Languages under concatenation and shuffling. Math. Structures Comput. Sci., 4:505\u2013511, 1994. 316, 317","journal-title":"Math. Structures Comput. Sci."},{"issue":"2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series-parallel digraphs. SIAM Journal of Computing, 11(2):298\u2013313, 1982. 316, 317, 321","journal-title":"SIAM Journal of Computing"},{"key":"25_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/3-540-54233-7_166","volume-title":"ICALP 91","author":"Th. Wilke","year":"1991","unstructured":"Th. Wilke. An Eilenbergt heorem for \u221e-languages. In: ICALP 91, LNCS 510, 588\u2013599, 1991. 327"},{"key":"25_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/3-540-63141-0_28","volume-title":"CONCUR 97","author":"H. Wimmel","year":"1997","unstructured":"H. Wimmel and L. Priese. Algebraic characterization of Petri net pomset semantics. In: CONCUR 97, LNCS 1243, 406\u2013420, Springer-Verlag, 1997. 316"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0304-3975(80)90004-3","volume":"12","author":"J. Winkowski","year":"1980","unstructured":"J. Winkowski. Behaviours of concurrent systems. Theoret. Comput. Sci., 12:39\u201360, 1980. 316","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR21","doi-asserted-by":"crossref","first-page":"403","DOI":"10.3233\/FI-1996-283413","volume":"28","author":"I. Winkowski","year":"1996","unstructured":"I. Winkowski. Concatenable weighted pomsets and their applications to modelling processes of Petri nets. Fund. Inform., 28:403\u2013421, 1996. 316","journal-title":"Fund. Inform."},{"key":"25_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course","author":"G. Winskel","year":"1987","unstructured":"G. Winskel. Event structures. In: Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, LNCS 255, 325\u2013392, Springer-Verlag, 1987. 316"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46691-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T19:19:24Z","timestamp":1587842364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46691-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668367","9783540466918"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-46691-6_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"9 June 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}