Abstract
We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions and thus our models do not involve the ”change-of-model” phenomena that arise when using Kripke models. However, we prove that the usual models can be constructed from ours by categorical adjunction. The generality and abstraction of our coalgebraic model turns out to be extremely useful in proving preservation properties of update. In particular, we prove that positive knowledge is preserved and acquired as a result of epistemic update. We also prove common and nested knowledge properties of epistemic updates induced by specific epistemic actions such as public and private announcements, lying, and in particular unsafe actions of security protocols. Our model directly gives rise to a coalgebraic logic with both dynamic and epistemic modalities. We prove a soundness and completeness result for this logic, and illustrate the applicability of the logic by deriving knowledge properties of a simple security protocol.
Research supported by EPSRC grant EP/D000033/1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baltag, A.: A coalgebraic semantics for epistemic programs. In: Proceedings of Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science, vol. 82 (2003)
Baltag, A., Coecke, B., Sadrzadeh, M.: Epistemic actions as resources. Journal of Logic and Computation, forthcoming
Baltag, A., Moss, L.S.: Logics for epistemic programs. Synthese 139 (2004)
van Benthem, J., Pacuit, E.: The tree of knowledge in action: towards a common perspective. In: Proceedings of Advances in Modal Logic (2006)
Cîrstea, C.: A compositional approach to defining logics for coalgebras. Theoretical Computer Science 327(1), 45–69 (2004)
Cîrstea, C., Pattinson, D.: Modular construction of modal logics. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 258–275. Springer, Heidelberg (2004)
Cîrstea, C.: On expressivity and compositionality in logics for coalgebras. In: Proceedings of Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science 82 (2003)
Cîrstea, C., Sadrzadeh, M.: Coalgebraic epistemic update without change of model, http://ecs.soton.ac.uk/~ms6/TechRep.pdf
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)
Gerbrandy, J.: Bisimulations on Planet Kripke. Ph. D. Thesis, University of Amsterdam (1999)
Jacobs, B.: The temporal logic of coalgebras via Galois algebras. Mathematical Structures in Computer Science 12, 875–903 (2002)
Jacobs, B.: Many-sorted coalgebraic modal logic: a model-theoretic study. Theoretical Informatics and Applications 35, 31–59 (2001)
Moss, L.S.: Coalgebraic logic. Annals of Pure and Applied Logic 96, 241–259 (1999)
Sadrzadeh, M.: Actions and Resources in Epistemic Logic. Ph.D. Thesis, University of Quebec at Montreal (2005), http://www.ecs.soton.ac.uk/~ms6/all.pdf
Sadrzadeh, M., Cîrstea, C.: Relating algebraic and coalgebraic logics of knowledge and update. In: Proceedings of the 7th conference on Logic and the Foundations of Game and Decision Theory, pp. 199–208, Liverpool (July 2006)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249, 3–80 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cîrstea, C., Sadrzadeh, M. (2007). Coalgebraic Epistemic Update Without Change of Model. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds) Algebra and Coalgebra in Computer Science. CALCO 2007. Lecture Notes in Computer Science, vol 4624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73859-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-73859-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73857-2
Online ISBN: 978-3-540-73859-6
eBook Packages: Computer ScienceComputer Science (R0)