{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T23:46:19Z","timestamp":1794354379900,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540789123","type":"print"},{"value":"9783540789130","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78913-0_16","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T08:13:06Z","timestamp":1207901586000},"page":"206-220","source":"Crossref","is-referenced-by-count":1,"title":["Non-termination in Idempotent Semirings"],"prefix":"10.1007","author":[{"given":"Peter","family":"H\u00f6fner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Arden, D.: Delayed logic and finite state machines. In: Theory of Computing Machine Design, pp. 1\u201335. University of Michigan Press (1960)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/10722010_4","volume-title":"Mathematics of Program Construction","author":"E. Cohen","year":"2000","unstructured":"Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 45\u201359. Springer, Heidelberg (2000)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Termination in modal Kleene algebra. In: L\u00e9vy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) IFIP TCS 2004, pp. 647\u2013660. Kluwer, Dordrecht (2004): Revised version: Algebraic Notions of Termination. Technical Report 2006-23, Institut f\u00fcr Informatik, Universit\u00e4t Augsburg (2006)","DOI":"10.1007\/1-4020-8141-3_49"},{"issue":"4","key":"16_CR4","doi-asserted-by":"crossref","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. Computational Logic\u00a07(4), 798\u2013833 (2006)","journal-title":"ACM Trans. Computational Logic"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/978-3-540-27812-2_7","volume-title":"Theory Is Forever","author":"Z. \u00c9sik","year":"2004","unstructured":"\u00c9sik, Z., Kuich, W.: A semiring-semimodule generalization of \u03c9-context-free languages. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol.\u00a03113, pp. 68\u201380. Springer, Heidelberg (2004)"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF00370431","volume":"44","author":"R. Goldblatt","year":"1985","unstructured":"Goldblatt, R.: An algebraic study of well-foundedness. Studia Logica\u00a044(4), 423\u2013437 (1985)","journal-title":"Studia Logica"},{"key":"16_CR7","unstructured":"H\u00f6fner, P., Struth, G.: January 14 (2008), http:\/\/www.dcs.shef.ac.uk\/~georg\/ka"},{"key":"16_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73595-3_19","volume-title":"Automated Deduction \u2013 CADE-21","author":"P. H\u00f6fner","year":"2007","unstructured":"H\u00f6fner, P., Struth, G.: Automated reasoning in Kleene algebra. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 279\u2013294. Springer, Heidelberg (2007)"},{"issue":"2","key":"16_CR9","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":"16_CR10","unstructured":"McCune, W.: Prover9 and Mace4, January 14 (2008), http:\/\/www.cs.unm.edu\/~mccune\/prover9"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.scico.2006.01.010","volume":"65","author":"B. M\u00f6ller","year":"2007","unstructured":"M\u00f6ller, B.: Kleene getting lazy. Sci. Comput. Programming\u00a065, 195\u2013214 (2007)","journal-title":"Sci. Comput. Programming"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.tcs.2005.09.069","volume":"351","author":"B. M\u00f6ller","year":"2006","unstructured":"M\u00f6ller, B., Struth, G.: Algebras of modal operators and partial correctness. Theoretical Computer Science\u00a0351(2), 221\u2013239 (2006)","journal-title":"Theoretical Computer Science"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"16_CR14","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. Studia Logica\u00a050, 571\u2013605 (1991)","journal-title":"Studia Logica"},{"key":"16_CR15","unstructured":"Struth, G.: Reasoning automatically about termination and refinement. In: Ranise, S. (ed.) International Workshop on First-Order Theorem Proving, Technical Report ULCS-07-018, Department of Computer Science, University of Liverpool, pp. 36\u201351 (2007)"},{"issue":"1-2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2003.09.002","volume":"51","author":"J. Wright von","year":"2004","unstructured":"von Wright, J.: Towards a refinement algebra. Science of Computer Programming\u00a051(1-2), 23\u201345 (2004)","journal-title":"Science of Computer Programming"}],"container-title":["Lecture Notes in Computer Science","Relations and Kleene Algebra in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78913-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:37Z","timestamp":1619507017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78913-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789123","9783540789130"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78913-0_16","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-78913-0","asserted-by":"object"}]},"subject":[]}}