{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:29:58Z","timestamp":1775096998560,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030336356","type":"print"},{"value":"9783030336363","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-33636-3_14","type":"book-chapter","created":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T10:02:20Z","timestamp":1571479340000},"page":"385-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Completeness and Incompleteness of Synchronous Kleene Algebra"],"prefix":"10.1007","author":[{"given":"Jana","family":"Wagemaker","sequence":"first","affiliation":[]},{"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Kapp\u00e9","sequence":"additional","affiliation":[]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,20]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"VM Antimirov","year":"1996","unstructured":"Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291\u2013319 (1996). \n                    https:\/\/doi.org\/10.1016\/0304-3975(95)00182-4","journal-title":"Theor. Comput. Sci."},{"key":"14_CR2","unstructured":"Backhouse, R.: Closure algorithms and the star-height problem of regular languages. PhD thesis, University of London (1975)"},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.scico.2005.10.008","volume":"61","author":"C Baier","year":"2006","unstructured":"Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in reo by constraint automata. Sci. Comput. Program. 61(2), 75\u2013113 (2006). \n                    https:\/\/doi.org\/10.1016\/j.scico.2005.10.008","journal-title":"Sci. Comput. Program."},{"issue":"1\u20133","key":"14_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"JA Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf. Control 60(1\u20133), 109\u2013137 (1984). \n                    https:\/\/doi.org\/10.1016\/S0019-9958(84)80025-X","journal-title":"Inf. Control"},{"key":"14_CR5","first-page":"419","volume":"24","author":"M Boffa","year":"1990","unstructured":"Boffa, M.: Une remarque sur les syst\u00e8mes complets d\u2019identit\u00e9s rationnelles. ITA 24, 419\u2013428 (1990)","journal-title":"ITA"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Proceedings of Principles of Programming Languages (POPL), pp. 457\u2013468 (2013). \n                    https:\/\/doi.org\/10.1145\/2429069.2429124","DOI":"10.1145\/2429069.2429124"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-22360-5_5","volume-title":"Implementation and Application of Automata","author":"S Broda","year":"2015","unstructured":"Broda, S., Cavadas, S., Ferreira, M., Moreira, N.: Deciding synchronous Kleene algebra with derivatives. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 49\u201362. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-22360-5_5"},{"issue":"4","key":"14_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964). \n                    https:\/\/doi.org\/10.1145\/321239.321249","journal-title":"J. ACM"},{"key":"14_CR9","volume-title":"Regular Algebra and Finite Machines","author":"John Horton Conway","year":"1971","unstructured":"John Horton Conway: Regular Algebra and Finite Machines. Chapman and Hall Ltd., London (1971)"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10817-014-9318-9","volume":"54","author":"S Foster","year":"2015","unstructured":"Foster, S., Struth, G.: On the fine-structure of regular algebra. J. Autom. Reason. 54(2), 165\u2013197 (2015). \n                    https:\/\/doi.org\/10.1007\/s10817-014-9318-9","journal-title":"J. Autom. Reason."},{"issue":"6","key":"14_CR11","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1007\/s00165-016-0384-0","volume":"28","author":"IJ Hayes","year":"2016","unstructured":"Hayes, I.J.: Generalised rely-guarantee concurrency: an algebraic foundation. Formal Asp. Comput. 28(6), 1057\u20131078 (2016). \n                    https:\/\/doi.org\/10.1007\/s00165-016-0384-0","journal-title":"Formal Asp. Comput."},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-319-48989-6_22","volume-title":"FM 2016: Formal Methods","author":"IJ Hayes","year":"2016","unstructured":"Hayes, I.J., Colvin, R.J., Meinicke, L.A., Winter, K., Velykis, A.: An algebra of synchronous atomic steps. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 352\u2013369. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-48989-6_22"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00165-018-0464-4","volume":"31","author":"IJ Hayes","year":"2019","unstructured":"Hayes, I.J., Meinicke, L.A., Winter, K., Colvin, R.J.: A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. Formal Asp. Comput. 31(2), 133\u2013163 (2019). \n                    https:\/\/doi.org\/10.1007\/s00165-018-0464-4","journal-title":"Formal Asp. Comput."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44693-1_3","volume-title":"STACS 2001","author":"D Kozen","year":"2001","unstructured":"Kozen, D.: Myhill-Nerode relations on automatic systems and the completeness of Kleene algebra. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 27\u201338. Springer, Heidelberg (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-44693-1_3"},{"issue":"4","key":"14_CR15","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). \n                    https:\/\/doi.org\/10.1016\/j.jlamp.2015.09.012","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"14_CR16","unstructured":"Kapp\u00e9, T., Brunet, P., Rot, J., Silva, A., Wagemaker, J., Zanasi, F.: Kleene algebra with observations. \n                    arXiv:1811.10401"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1007\/978-3-319-89884-1_30","volume-title":"Programming Languages and Systems","author":"Tobias Kapp\u00e9","year":"2018","unstructured":"Kapp\u00e9, T., Brunet, P., Silva, A., Zanasi, F.: Concurrent Kleene algebra: free model and completeness. In: Proceedings of European Symposium on Programming (ESOP), pp. 856\u2013882 (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-89884-1_30"},{"issue":"2","key":"14_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). \n                    https:\/\/doi.org\/10.1006\/inco.1994.1037","journal-title":"Inf. Comput."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44693-1_3","volume-title":"STACS 2001","author":"Dexter Kozen","year":"2001","unstructured":"Kozen, D.: Myhill-Nerode relations on automatic systems and the completeness of Kleene algebra. In: Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS), pp. 27\u201338 (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-44693-1_3"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-63172-0_43","volume-title":"Computer Science Logic","author":"D Kozen","year":"1997","unstructured":"Kozen, D., Smith, F.: Kleene algebra with tests: completeness and decidability. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol. 1258, pp. 244\u2013259. Springer, Heidelberg (1997). \n                    https:\/\/doi.org\/10.1007\/3-540-63172-0_43"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D Krob","year":"1991","unstructured":"Krob, D.: Complete systems of B-rational identities. Theor. Comput. Sci. 89(2), 207\u2013343 (1991). \n                    https:\/\/doi.org\/10.1016\/0304-3975(91)90395-I","journal-title":"Theor. Comput. Sci."},{"key":"14_CR22","unstructured":"Laurence, M.R., Struth, G.: Completeness theorems for pomset languages and concurrent Kleene algebras. \n                    arXiv:1705.05896"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theor. Comput. Sci. 25, 267\u2013310 (1983). \n                    https:\/\/doi.org\/10.1016\/0304-3975(83)90114-7","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"14_CR24","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.jlap.2010.07.009","volume":"79","author":"C Prisacariu","year":"2010","unstructured":"Prisacariu, C.: Synchronous Kleene algebra. J. Log. Algebr. Program. 79(7), 608\u2013635 (2010). \n                    https:\/\/doi.org\/10.1016\/j.jlap.2010.07.009","journal-title":"J. Log. Algebr. Program."},{"issue":"1\u20133","key":"14_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00895-2","volume":"308","author":"JJMM Rutten","year":"2003","unstructured":"Rutten, J.J.M.M.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theor. Comput. Sci. 308(1\u20133), 1\u201353 (2003). \n                    https:\/\/doi.org\/10.1016\/S0304-3975(02)00895-2","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A Salomaa","year":"1966","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. ACM 13(1), 158\u2013169 (1966). \n                    https:\/\/doi.org\/10.1145\/321312.321326","journal-title":"J. ACM"},{"key":"14_CR27","unstructured":"Silva, A.: Kleene Coalgebra. PhD thesis, Radboud Universiteit Nijmegen (2010)"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33636-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T10:11:27Z","timestamp":1571479887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33636-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030336356","9783030336363"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33636-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematics of Program Construction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mpc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.nott.ac.uk\/~pszgmh\/mpc19.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}