Results 1 -
4 of
4
Modular construction of modal logics
- Concurrency Theory, CONCUR 04, volume 3170 of Lect. Notes Comput. Sci
, 2004
"... Abstract. We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can ..."
Abstract
-
Cited by 19 (6 self)
- Add to MetaCart
Abstract. We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular way. Moreover, we show that the logics thus obtained inherit soundness, completeness and expressiveness properties from their building blocks. We apply these techniques to derive sound, complete and expressive logics for a wide variety of probabilistic systems. 1
M.: Coalgebraic epistemic update without change of model http://ecs.soton.ac.uk
- ms6/TechRep.pdf
, 2007
"... 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 ..."
Abstract
- Add to MetaCart
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. 1
Coalgebras, Stone Duality, Modal Logic
, 2006
"... A brief outline of the topics of the course could be as follows. Coalgebras generalise transition systems. Modal logics are the natural logics for coalgebras. Stone duality provides the relationship between coalgebras and modal logic. Furthermore, some basic category theory is needed to understand c ..."
Abstract
- Add to MetaCart
A brief outline of the topics of the course could be as follows. Coalgebras generalise transition systems. Modal logics are the natural logics for coalgebras. Stone duality provides the relationship between coalgebras and modal logic. Furthermore, some basic category theory is needed to understand coalgebras as well as Stone duality. So we

