{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:29:55Z","timestamp":1775096995370,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319898834","type":"print"},{"value":"9783319898841","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89884-1_30","type":"book-chapter","created":{"date-parts":[[2018,4,14]],"date-time":"2018-04-14T01:02:32Z","timestamp":1523667752000},"page":"856-882","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Concurrent Kleene Algebra: Free Model and Completeness"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Kapp\u00e9","sequence":"first","affiliation":[]},{"given":"Paul","family":"Brunet","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Zanasi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"30_CR1","unstructured":"Backhouse, R.: Closure algorithms and the star-height problem of regular languages. Ph.D. thesis, University of London (1975)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Proceedings of the Principles of Programming Languages (POPL), pp. 457\u2013468 (2013)","DOI":"10.1145\/2429069.2429124"},{"key":"30_CR3","unstructured":"Brunet, P., Pous, D., Struth, G.: On decidability of concurrent Kleene algebra. In: Proceedings of the Concurrency Theory (CONCUR), pp. 28:1\u201328:15 (2017)"},{"key":"30_CR4","volume-title":"Regular Algebra and Finite Machines","author":"JH Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall Ltd., London (1971)"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Foster, N., Kozen, D., Milano, M., Silva, A., Thompson, L.: A coalgebraic decision procedure for NetKAT. In: Proceedings of the Principles of Programming Languages (POPL), pp. 343\u2013355 (2015)","DOI":"10.1145\/2676726.2677011"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"JL Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. Theor. Comput. Sci. 61, 199\u2013224 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"30_CR7","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. Fundam. Inform. 4(2), 427 (1981)","journal-title":"Fundam. Inform."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Hoare, T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra. In: Proceedings of the Concurrency Theory (CONCUR), pp. 399\u2013414 (2009)","DOI":"10.1007\/978-3-642-04081-8_27"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.jlamp.2015.09.012","volume":"85","author":"T Hoare","year":"2016","unstructured":"Hoare, T., van Staden, S., M\u00f6ller, B., Struth, G., Zhu, H.: Developments in concurrent Kleene algebra. J. Log. Algebr. Meth. Program. 85(4), 617\u2013636 (2016)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"30_CR10","unstructured":"Hopcroft, J.E., Karp, R.M.: A linear algorithm for testing equivalence of finite automata. Technical report, TR71-114, December 1971"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-19195-9_2","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"A Horn","year":"2015","unstructured":"Horn, A., Kroening, D.: On partial order semantics for SAT\/SMT-based symbolic encodings of weak memory concurrency. In: Graf, S., Viswanathan, M. (eds.) FORTE 2015. LNCS, vol. 9039, pp. 19\u201334. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19195-9_2"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(95)00132-8","volume":"154","author":"L Jategaonkar","year":"1996","unstructured":"Jategaonkar, L., Meyer, A.R.: Deciding true concurrency equivalences on safe, finite nets. Theor. Comput. Sci. 154(1), 107\u2013143 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"30_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.jlamp.2015.12.005","volume":"85","author":"P Jipsen","year":"2016","unstructured":"Jipsen, P., Moshier, M.A.: Concurrent Kleene algebra with tests and branching automata. J. Log. Algebr. Methods Program. 85(4), 637\u2013652 (2016)","journal-title":"J. Log. Algebr. Methods Program."},{"key":"30_CR14","unstructured":"Kapp\u00e9, T., Brunet, P., Luttik, B., Silva, A., Zanasi, F.: Brzozowski goes concurrent\u2014a Kleene theorem for pomset languages. In: Proceedings of the Concurrency Theory (CONCUR), pp. 25:1\u201325:16 (2017)"},{"key":"30_CR15","unstructured":"Kapp\u00e9, T., Brunet, P., Silva, A., Zanasi, F.: Concurrent Kleene algebra: free model and completeness. https:\/\/arxiv.org\/abs\/1710.02787"},{"key":"30_CR16","unstructured":"Kapp\u00e9, T., Brunet, P., Silva, A., Zanasi, F.: Tools for concurrent Kleene algebra, Sep 2017. https:\/\/doi.org\/10.5281\/zenodo.926823"},{"key":"30_CR17","first-page":"3","volume-title":"Automata Studies","author":"SC Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3\u201341. Princeton University Press, Princeton (1956)"},{"issue":"2","key":"30_CR18","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. Inf. Comput. 110(2), 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"key":"30_CR19","unstructured":"Laurence, M.R., Struth, G.: Completeness theorems for pomset languages and concurrent Kleene algebras. https:\/\/arxiv.org\/abs\/1705.05896"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-06251-8_5","volume-title":"Relational and Algebraic Methods in Computer Science","author":"MR Laurence","year":"2014","unstructured":"Laurence, M.R., Struth, G.: Completeness theorems for Bi-Kleene algebras and series-parallel rational pomset languages. In: H\u00f6fner, P., Jipsen, P., Kahl, W., M\u00fcller, M.E. (eds.) RAMICS 2014. LNCS, vol. 8428, pp. 65\u201382. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06251-8_5"},{"issue":"141\u2013146","key":"30_CR21","first-page":"82","volume":"36","author":"FW Levi","year":"1944","unstructured":"Levi, F.W.: On semigroups. Bull. Calcutta Math. Soc. 36(141\u2013146), 82 (1944)","journal-title":"Bull. Calcutta Math. Soc."},{"issue":"1","key":"30_CR22","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. Theor. Comput. Sci. 237(1), 347\u2013380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-35843-2_32","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"J Rot","year":"2013","unstructured":"Rot, J., Bonsangue, M., Rutten, J.: Coalgebraic bisimulation-up-to. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 369\u2013381. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35843-2_32"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89884-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,19]],"date-time":"2022-08-19T16:14:40Z","timestamp":1660925680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89884-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319898834","9783319898841"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89884-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}