A useful tool for modelling behaviour in theoretical computer science is the concept of coalgebras. Coalgebras enable one to model execution of programs step by step using categorical structures and polynomial endofunctors. In our paper, we start with a short introduction of basic notions and we use this method for modelling structural operational semantics of a simple imperative language.
Linear logic appears as a suitable logical system for description of dynamic properties of various network activities in computer science. It disposes with new connectives which create new opportunities to describe properties of real network processes, e.g. parallelism, causality and commutativity of duality between processes. We extend this logic with Aristotelian modalities and we formulate their appropriate model. In our contribution we show how a real network attack can be formalized in this logical system as a polarized game.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.