{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:47Z","timestamp":1776316907871,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031280825","type":"print"},{"value":"9783031280832","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-28083-2_13","type":"book-chapter","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T09:03:07Z","timestamp":1678179787000},"page":"208-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Complexity of\u00a0Kleene Algebra with\u00a0Domain"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1942-7982","authenticated-orcid":false,"given":"Igor","family":"Sedl\u00e1r","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00165-015-0343-1","volume":"28","author":"A Armstrong","year":"2016","unstructured":"Armstrong, A., Gomes, V.B.F., Struth, G.: Building program construction and verification tools from algebraic principles. Form. Aspects Comput. 28(2), 265\u2013293 (2016)","journal-title":"Form. Aspects Comput."},{"key":"13_CR2","unstructured":"Cohen, E., Kozen, D., Smith, F.: The complexity of Kleene algebra with tests. Technical report TR96-1598, Computer Science Department, Cornell University, July 1996"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/1183278.1183285","volume":"7","author":"J Desharnais","year":"2006","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Kleene algebra with domain. ACM Trans. Comput. Log. 7(4), 798\u2013833 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-70594-9_19","volume-title":"Mathematics of Program Construction","author":"J Desharnais","year":"2008","unstructured":"Desharnais, J., Struth, G.: Modal semirings revisited. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol. 5133, pp. 360\u2013387. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70594-9_19"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Struth, G.: Internal axioms for domain semirings. Sci. Comput. Program. 76(3), 181\u2013203 (2011). Special issue on the Mathematics of Program Construction (MPC 2008)","DOI":"10.1016\/j.scico.2010.05.007"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"MJ Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00628304","volume":"14","author":"J Groenendijk","year":"1991","unstructured":"Groenendijk, J., Stokhof, M.: Dynamic predicate logic. Linguist. Philos. 14(1), 39\u2013100 (1991)","journal-title":"Linguist. Philos."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)","DOI":"10.7551\/mitpress\/2516.001.0001"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jlap.2010.07.019","volume":"80","author":"R Hirsch","year":"2011","unstructured":"Hirsch, R., Mikul\u00e1s, S.: Axiomatizability of representable domain algebras. J. Log. Algebr. Program. 80(2), 75\u201391 (2011)","journal-title":"J. Log. Algebr. Program."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BFb0028021","volume-title":"Computer Science Logic","author":"M Hollenberg","year":"1998","unstructured":"Hollenberg, M.: Equational axioms of test algebra. In: Nielsen, M., Thomas, W. (eds.) CSL 1997. LNCS, vol. 1414, pp. 295\u2013310. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028021"},{"key":"13_CR11","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Boston (1979)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-10003-2_83","volume-title":"Automata, Languages and Programming","author":"D Kozen","year":"1980","unstructured":"Kozen, D.: A representation theorem for models of *-free PDL. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 351\u2013362. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_83"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0029594","volume-title":"Mathematical Foundations of Computer Science 1990","author":"D Kozen","year":"1990","unstructured":"Kozen, D.: On Kleene algebras and closed semirings. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452, pp. 26\u201347. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0029594"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Kozen, D.: The Design and Analysis of Algorithms. Springer, New York (1992). https:\/\/doi.org\/10.1007\/978-1-4614-1701-9","DOI":"10.1007\/978-1-4614-1701-9"},{"issue":"2","key":"13_CR15","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."},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19(3), 427\u2013443 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","volume":"14","author":"D Kozen","year":"1981","unstructured":"Kozen, D., Parikh, R.: An elementary proof of the completeness of PDL. Theor. Comput. Sci. 14, 113\u2013118 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR18","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). https:\/\/doi.org\/10.1007\/3-540-63172-0_43"},{"key":"13_CR19","unstructured":"Mbacke, S.D.: Completeness for Domain Semirings and Star-continuous Kleene Algebras with Domain. mathesis, Universit\u00e9 Laval (2018)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"McLean, B.: Free Kleene algebras with domain. J. Log. Algebr. Methods Program. 117, 100606 (2020)","DOI":"10.1016\/j.jlamp.2020.100606"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, B., Struth, G.: Algebras of modal operators and partial correctness. Theor. Comput. Sci. 351(2):221\u2013239 (2006). Algebraic Methodology and Software Technology","DOI":"10.1016\/j.tcs.2005.09.069"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/BF00370685","volume":"50","author":"V Pratt","year":"1991","unstructured":"Pratt, V.: Dynamic algebras: examples, constructions, applications. Stud. Log. 50(3), 571\u2013605 (1991)","journal-title":"Stud. Log."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Models of program logics. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, FOCS 1979, pp. 115\u2013122. IEEE Computer Society, USA (1979)","DOI":"10.1109\/SFCS.1979.24"},{"issue":"4","key":"13_CR24","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.ipl.2015.11.007","volume":"116","author":"G Struth","year":"2016","unstructured":"Struth, G.: On the expressive power of Kleene algebra with domain. Inf. Process. Lett. 116(4), 284\u2013288 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0022-0000(87)90014-6","volume":"35","author":"V Trnkov\u00e1","year":"1987","unstructured":"Trnkov\u00e1, V., Reiterman, J.: Dynamic algebras with test. J. Comput. Syst. Sci. 35(2), 229\u2013242 (1987)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-28083-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:39:55Z","timestamp":1710268795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-28083-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031280825","9783031280832"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-28083-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics20.lis-lab.fr\/","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":"26","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":"17","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":"65% - 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":"17","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)"}}]}}