{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:35:07Z","timestamp":1754195707465},"publisher-location":"Boston","reference-count":17,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_49","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"647-660","source":"Crossref","is-referenced-by-count":7,"title":["Termination in Modal Kleene Algebra"],"prefix":"10.1007","author":[{"given":"Jules","family":"Desharnais","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"M\u00f6ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"F. Baader, T. Nipkow. Term rewriting and all that. Cambridge University Press 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"L. Bachmair, N. Dershowitz. Commutation, transformation, and termination. In J.H. Siekmann (ed.), 8th International Conference on Automated Deduction. LNCS 230. Springer 1986, 5\u201320.","DOI":"10.1007\/3-540-16780-3_76"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"B.F. Chellas. Modal Logic: An Introduction. Cambridge University Press 1980.","DOI":"10.1017\/CBO9780511621192"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"E. Cohen. Separation and reduction. In R. Backhouse, J.N. Oliveira (eds.), Proc. Mathematics of Program Construction, 5th International Conference, MPC 2000. LNCS 1887. Springer 2000, 45\u201359.","DOI":"10.1007\/10722010_4"},{"key":"49_CR5","unstructured":"J.H. Conway. Regular Algebra and Finite State Machines. Chapman & Hall 1971."},{"key":"49_CR6","unstructured":"J. Desharnais, B. M\u00f6ller, G. Struth. Kleene algebra with domain. Technical Report 2003-07, Universit\u00e4t Augsburg, Institut f\u00fcr Informatik, June 2003."},{"key":"49_CR7","unstructured":"J. Desharnais, B. M\u00f6ller, G. Struth. Termination in modal Kleene algebra. Technical Report 2004-04, Universit\u00e4t Augsburg, Institut f\u00fcr Informatik, January 2004."},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0304-3975(96)00154-5","volume":"179","author":"H. Doornbos","year":"1997","unstructured":"H. Doornbos, R. Backhouse, J. van der Woude. A calculational approach to mathematical induction. Theoretical Computer Science, 179:103\u2013135 (1997).","journal-title":"Theoretical Computer Science"},{"key":"49_CR9","unstructured":"A. Geser. Relative termination. PhD thesis, Fakult\u00e4t fur Mathematik und Informatik, Universit\u00e4t Passau 1990."},{"issue":"4","key":"49_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/BF00370431","volume":"44","author":"R. Goldblatt","year":"1985","unstructured":"R. Goldblatt., R. An algebraic study of well-foundedness. Studia Logica, 44(4):422\u2013437 (1985).","journal-title":"Studia Logica"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"D. Harel, D. Kozen, J. Tiuryn. Dynamic Logic. MIT Press 2000.","DOI":"10.7551\/mitpress\/2516.001.0001"},{"issue":"2","key":"49_CR12","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2):366\u2013390 (1994).","journal-title":"Information and Computation"},{"issue":"3","key":"49_CR13","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"D. Kozen. Kleene algebra with tests. Trans. Programming Languages and Systems, 19(3):427\u2013443 (1997).","journal-title":"Trans. Programming Languages and Systems"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"G. Schmidt, T. Str\u00f6hlein. Relations and Graphs. EATCS Monographs in Computer Science. Springer 1993.","DOI":"10.1007\/978-3-642-77968-8"},{"key":"49_CR15","unstructured":"G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, Max-Planck-Institut f\u00fcr Informatik Saarbr\u00fccken 1996."},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"G. Struth. Calculating Church-Rosser proofs in Kleene algebra. In H.C.M. de Swart (ed.), Relational Methods in Computer Science, 6th International Conference. LNCS 2561. Springer 2002, 276\u2013290.","DOI":"10.1007\/3-540-36280-0_19"},{"key":"49_CR17","unstructured":"G. Struth. An algebraic study of commutation and termination. Technical Report 2003-18, Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, December 2003."}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:28:25Z","timestamp":1619555305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_49","relation":{},"subject":[]}}