{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:46Z","timestamp":1761596986803},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540378730"},{"type":"electronic","value":"9783540378747"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11828563_15","type":"book-chapter","created":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T10:43:15Z","timestamp":1159872195000},"page":"222-234","source":"Crossref","is-referenced-by-count":9,"title":["Omega Algebra, Demonic Refinement Algebra and Commands"],"prefix":"10.1007","author":[{"given":"Peter","family":"H\u00f6fner","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"M\u00f6ller","sequence":"additional","affiliation":[]},{"given":"Kim","family":"Solin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1674-2","volume-title":"Refinement calculus: a systematic introduction","author":"R.J. Back","year":"1998","unstructured":"Back, R.J., von Wright, J.: Refinement calculus: a systematic introduction. Springer, Heidelberg (1998)"},{"key":"15_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. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 45\u201359. Springer, Heidelberg (2000)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/11828563_8","volume-title":"Relations and Kleene Algebra in Computer Science","author":"J.-L. Carufel De","year":"2006","unstructured":"De Carufel, J.-L., Desharnais, J.: Demonic algebra with domain. In: Schmidt, R., Struth, G. (eds.) RelMiCS\/AKA 2006. LNCS, vol.\u00a04136, pp. 120\u2013134. Springer, Heidelberg (2006)"},{"key":"15_CR4","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Kleene algebra with domain. Technical Report 2003-7, Universit\u00e4t Augsburg, Institut f\u00fcr Informatik, Revised version to appear in ACM TOCL (2003)"},{"key":"15_CR5","series-title":"IFIP International Federation for Information Processing Series","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/1-4020-8141-3_49","volume-title":"Exploring new frontiers of theoretical informatics","author":"J. Desharnais","year":"2004","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Termination in modal Kleene algebra. In: L\u00e9vy, J.-J., Mayr, E., Mitchell, J. (eds.) Exploring new frontiers of theoretical informatics. IFIP International Federation for Information Processing Series, vol.\u00a0155, pp. 653\u2013666. Kluwer, Dordrecht (2004)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(99)00021-0","volume":"37","author":"R.M. Dijkstra","year":"2000","unstructured":"Dijkstra, R.M.: Computation calculus bridging a formalisation gap. Science of Computer Programming\u00a037, 3\u201336 (2000)","journal-title":"Science of Computer Programming"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11768173_14","volume-title":"Unifying Theories of Programming","author":"W. Guttmann","year":"2006","unstructured":"Guttmann, W., M\u00f6ller, B.: Modal design algebra. In: Dunne, S., Stoddart, B. (eds.) UTP 2006. LNCS, vol.\u00a04010, pp. 236\u2013256. Springer, Heidelberg (2006)"},{"key":"15_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"key":"15_CR9","volume-title":"Unifying theories of programming","author":"C.A.R. Hoare","year":"1998","unstructured":"Hoare, C.A.R., He, J.: Unifying theories of programming. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"15_CR10","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.\u00a0110, 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"key":"15_CR11","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 Transactions on Programming Languages and Systems\u00a019, 427\u2013443 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-27764-4_14","volume-title":"Mathematics of Program Construction","author":"B. M\u00f6ller","year":"2004","unstructured":"M\u00f6ller, B.: Lazy kleene algebra. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 252\u2013273. Springer, Heidelberg (2004); Revised version: B. M\u00f6ller: Kleene getting lazy. Sci. Comput. Prog. (to appear)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-27815-3_30","volume-title":"Algebraic Methodology and Software Technology","author":"B. M\u00f6ller","year":"2004","unstructured":"M\u00f6ller, B., Struth, G.: Modal Kleene algebra and partial correctness. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol.\u00a03116, pp. 379\u2013393. Springer, Heidelberg (2004); Revised and extended version: B. M\u00f6ller, G. Struth: Algebras of modal operators and partial correctness. Theoretical Computer Science 351, 221\u2013239 (2006)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11734673_16","volume-title":"Relational Methods in Computer Science","author":"B. M\u00f6ller","year":"2006","unstructured":"M\u00f6ller, B., Struth, G.: wp is wlp. In: MacCaull, W., Winter, M., D\u00fcntsch, I. (eds.) RelMiCS 2005. LNCS, vol.\u00a03929, pp. 200\u2013211. Springer, Heidelberg (2006)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0020-0190(88)90147-0","volume":"26","author":"C. Morgan","year":"1988","unstructured":"Morgan, C.: Data Refinement by Miracles. Inf. Process. Lett.\u00a026, 243\u2013246 (1988)","journal-title":"Inf. Process. Lett."},{"key":"15_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00276019","volume":"26","author":"J.M. Morris","year":"1989","unstructured":"Morris, J.M.: Laws of data refinement. Acta Informatica\u00a0(26), 287\u2013308 (1989)","journal-title":"Acta Informatica"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/69558.69559","volume":"11","author":"G. Nelson","year":"1989","unstructured":"Nelson, G.: A generalization of Dijkstra\u2019s calculus. ACM TOPLAS\u00a011, 517\u2013561 (1989)","journal-title":"ACM TOPLAS"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11783596_23","volume-title":"Mathematics of Program Construction","author":"K. Solin","year":"2006","unstructured":"Solin, K., von Wright, J.: Refinement algebra with operators for enabledness and termination. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol.\u00a04014, pp. 397\u2013415. Springer, Heidelberg (2006)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-45442-X_14","volume-title":"Mathematics of Program Construction","author":"J. Wright von","year":"2002","unstructured":"von Wright, J.: From kleene algebra to refinement algebra. In: Boiten, E.A., M\u00f6ller, B. (eds.) MPC 2002. LNCS, vol.\u00a02386, pp. 233\u2013262. Springer, Heidelberg (2002)"},{"key":"15_CR20","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. Sci. Comput. Prog.\u00a051, 23\u201345 (2004)","journal-title":"Sci. Comput. Prog."}],"container-title":["Lecture Notes in Computer Science","Relations and Kleene Algebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11828563_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T21:10:23Z","timestamp":1707253823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11828563_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540378730","9783540378747"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11828563_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}