{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:38:31Z","timestamp":1725507511844},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540789123"},{"type":"electronic","value":"9783540789130"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78913-0_24","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T12:13:06Z","timestamp":1207915986000},"page":"320-336","source":"Crossref","is-referenced-by-count":2,"title":["Knowledge and Games in Modal Semirings"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"M\u00f6ller","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1674-2","volume-title":"Refinement calculus \u2014 A systematic introduction","author":"R.J. Back","year":"1998","unstructured":"Back, R.J., von Wright, J.: Refinement calculus \u2014 A systematic introduction. Springer, Heidelberg (1998)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-540-24771-5_4","volume-title":"Relational and Kleene-Algebraic Methods in Computer Science","author":"R. Backhouse","year":"2004","unstructured":"Backhouse, R., Michaelis, D.: Fixed-point characterisation of winning strategies in impartial games. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol.\u00a03051, pp. 34\u201347. Springer, Heidelberg (2004)"},{"key":"24_CR3","unstructured":"Baltag, A., Moss, L., Solecki, S.: The logic of public announcements, common knowledge, and private suspicions. In: Proc. 7th conference on Theoretical Aspects of Rationality and Knowledge, Evanston, Illinois, pp. 43\u201356 (1998)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1093\/logcom\/exm015","volume":"17","author":"A. Baltag","year":"2007","unstructured":"Baltag, A., Coecke, B., Sadrzadeh, M.: Epistemic actions as resources. J. Log. Comput.\u00a017, 555\u2013585 (2007)","journal-title":"J. Log. Comput."},{"key":"24_CR5","unstructured":"van Benthem, J., Liu, F.: Dynamic logic of preference upgrade. J. Applied Non-Classical Logics 2006 (manuscript, 2004) (to appear)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/B978-044482830-9\/50023-0","volume-title":"Handbook of process algebra","author":"J.A. Bergstra","year":"2001","unstructured":"Bergstra, J.A., Fokkink, W., Ponse, A.: Process algebra with recursive operations. In: Bergstra, J.A., Smolka, S., Ponse, A. (eds.) Handbook of process algebra, pp. 333\u2013389. North-Holland, Amsterdam (2001)"},{"key":"24_CR7","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":"24_CR8","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Kleene algebra with domain. Institute of Computer Science, University of Augsburg, Technical Report 2003-7. Revised version: ACM Transaction on Computational Logic 7(4), 798\u2013833 (2006)"},{"key":"24_CR9","first-page":"93","volume":"1","author":"J. Desharnais","year":"2004","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Modal Kleene algebra and applications \u2014 A survey. Journal on Relational Methods in Computer Science\u00a01, 93\u2013131 (2004)","journal-title":"Journal on Relational Methods in Computer Science"},{"key":"24_CR10","series-title":"IFIP Series","first-page":"653","volume-title":"Exploring new frontiers of theoretical informatics","author":"J. Desharnais","year":"2006","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 Series, vol.\u00a0155, pp. 653\u2013666. Kluwer, Dordrecht (2006), Extended version: Institute of Computer Science, University of Augsburg, Technical Report 2006-23"},{"key":"24_CR11","volume-title":"A discipline of programming","author":"E. Dijkstra","year":"1976","unstructured":"Dijkstra, E.: A discipline of programming. Prentice-Hall, Englewood Cliffs (1976)"},{"key":"24_CR12","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":"24_CR13","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)"},{"key":"24_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810275","volume-title":"Logic in computer science \u2014 Modelling and reasoning about systems","author":"M. Huth","year":"2004","unstructured":"Huth, M., Ryan, M.: Logic in computer science \u2014 Modelling and reasoning about systems, 2nd edn. Cambridge University Press, Cambridge (2004)","edition":"2"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"891","DOI":"10.2307\/2372123","volume":"73","author":"B. J\u00f3nsson","year":"1951","unstructured":"J\u00f3nsson, B., Tarski, A.: Boolean algebras with operators, Part I. American Journal of Mathematics\u00a073, 891\u2013939 (1951)","journal-title":"American Journal of Mathematics"},{"issue":"2","key":"24_CR16","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(2), 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"issue":"3","key":"24_CR17","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(3), 427\u2013443 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"24_CR18","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, automata, languages. In: EATCS Monographs on Theoretical Computer Science, vol.\u00a05, Springer, Heidelberg (1986)"},{"key":"24_CR19","unstructured":"McCarthy, J.: Formalization of two puzzles involving knowledge, \n                  \n                    http:\/\/www-formal.stanford.edu\/jmc\/puzzles\/puzzles.html"},{"key":"24_CR20","unstructured":"McCune, W.: Prover9 and Mace4, \n                  \n                    http:\/\/www.cs.unm.edu\/~mccune\/mace4\/"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. Science of Computer Programming (in press)"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/11784180_21","volume-title":"Algebraic Methodology and Software Technology","author":"B. M\u00f6ller","year":"2006","unstructured":"M\u00f6ller, B., H\u00f6fner, P., Struth, G.: Quantales and temporal logics. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol.\u00a04019, pp. 263\u2013277. Springer, Heidelberg (2006)"},{"key":"24_CR23","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, 221\u2013239 (2006)","journal-title":"Theoretical Computer Science"},{"key":"24_CR24","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 Transactions on Programming Languages and Systems\u00a011, 517\u2013561 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/3-540-12689-9_117","volume-title":"Foundations of Computation Theory","author":"R. Parikh","year":"1983","unstructured":"Parikh, R.: Propositional logics of programs: new directions. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 347\u2013359. Springer, Heidelberg (1983)"},{"key":"24_CR26","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1027354826364","volume":"75","author":"M. Pauly","year":"2003","unstructured":"Pauly, M., Parikh, R.: Game logic \u2013 An overview. Studia Logica\u00a075, 165\u2013182 (2003)","journal-title":"Studia Logica"},{"key":"24_CR27","unstructured":"Solin, K.: Dynamic epistemic semirings. Institute of Computer Science, University of Augsburg, Technical Report, 2006 (June 17, 2006)"},{"key":"24_CR28","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":"24_CR29","unstructured":"Wikipedia: Unexpected hanging paradox, \n                  \n                    http:\/\/en.wikipedia.org\/wiki\/Unexpected_hanging_paradox"}],"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_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:03:40Z","timestamp":1619521420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78913-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789123","9783540789130"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78913-0_24","relation":{},"subject":[]}}