{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:30:00Z","timestamp":1775097000105,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319062501","type":"print"},{"value":"9783319062518","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06251-8_5","type":"book-chapter","created":{"date-parts":[[2014,4,8]],"date-time":"2014-04-08T01:32:39Z","timestamp":1396920759000},"page":"65-82","source":"Crossref","is-referenced-by-count":8,"title":["Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Laurence","sequence":"first","affiliation":[]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"4","author":"J. Grabowski","year":"1981","unstructured":"Grabowski, J.: On partial languages. Fundamenta Informaticae\u00a04(2), 427\u2013498 (1981)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: On the composition of processes. In: DeMillo, R.A. (ed.) POPL 1982, pp. 213\u2013223. ACM (1982)","DOI":"10.1145\/582153.582177"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-15648-8_22","volume-title":"Logics of Programs","author":"V.R. Pratt","year":"1985","unstructured":"Pratt, V.R.: Some constructions for order-theoretic models of concurrency. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 269\u2013283. Springer, Heidelberg (1985)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-45694-5_31","volume-title":"CONCUR 2002 - Concurrency Theory","author":"S.D. Brookes","year":"2002","unstructured":"Brookes, S.D.: Traces, pomsets, fairness and full abstraction for communicating processes. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 466\u2013482. Springer, Heidelberg (2002)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0304-3975(02)00021-X","volume":"281","author":"P. Gastin","year":"2002","unstructured":"Gastin, P., Mislove, M.: A truly concurrent semantics for a process algebra using resource pomsets. Theoretical Computer Science\u00a0281, 369\u2013421 (2002)","journal-title":"Theoretical Computer Science"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-16690-7_14","volume-title":"Unifying Theories of Programming","author":"Y. Zhao","year":"2010","unstructured":"Zhao, Y., Wang, X., Zhu, H.: Towards a pomset semantics for a shared-variable parallel language. In: Qin, S. (ed.) UTP 2010. LNCS, vol.\u00a06445, pp. 271\u2013285. Springer, Heidelberg (2010)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BFb0028590","volume-title":"STACS 98","author":"K. Lodaya","year":"1998","unstructured":"Lodaya, K., Weil, P.: Series-parallel posets: Algebra, automata and languages. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 555\u2013565. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K. Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoretical Computer Science\u00a0237(1-2), 347\u2013380 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J.L. Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. Theoretical Computer Science\u00a061(2-3), 199\u2013224 (1988)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation\u00a0110(2), 366\u2013390 (1994)","journal-title":"Information and Computation"},{"key":"5_CR11","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall (1971)"},{"issue":"6","key":"5_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"T. Hoare","year":"2011","unstructured":"Hoare, T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. Journal of Logical Algebraic Programming\u00a080(6), 266\u2013296 (2011)","journal-title":"Journal of Logical Algebraic Programming"},{"issue":"1&2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(95)00230-8","volume":"163","author":"S.L. Bloom","year":"1996","unstructured":"Bloom, S.L., \u00c9sik, Z.: Free shuffle algebras in language varieties. Theoretical Computer Science\u00a0163(1&2), 55\u201398 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM Journal of Computing\u00a011(2), 298\u2013313 (1982)","journal-title":"SIAM Journal of Computing"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-46011-X_18","volume-title":"Developments in Language Theory","author":"Z. \u00c9sik","year":"2002","unstructured":"\u00c9sik, Z., N\u00e9meth, Z.L.: Automata on series-parallel biposets. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 217\u2013227. Springer, Heidelberg (2002)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: Preliminary report. In: Aho, A.V., Borodin, A., Constable, R.L., Floyd, R.W., Harrison, M.A., Karp, R.M., Strong, H.R. (eds.) STOC 1973, pp. 1\u20139. ACM (1973)","DOI":"10.1145\/800125.804029"},{"key":"5_CR17","unstructured":"Stockmeyer, L.J.: The Complexity of Decision Problems in Automata Theory and Logic. PhD thesis. MIT, Cambridge, Massachusetts, USA (1974)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11780274_20","volume-title":"Algebra, Meaning, and Computation","author":"B. Jacobs","year":"2006","unstructured":"Jacobs, B.: A bialgebraic review of deterministic automata, regular expressions and languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol.\u00a04060, pp. 375\u2013404. Springer, Heidelberg (2006)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Bonsangue, M.M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM TOCL\u00a014(1) (2013)","DOI":"10.1145\/2422085.2422092"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06251-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:10:12Z","timestamp":1648779012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06251-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319062501","9783319062518"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06251-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}