A Coalgebra as an Intrusion Detection System
暂无分享,去创建一个
In this paper we construct a coalgebra for an intrusion detection system to describe the behaviour of a packet stream together with selected actions in the case of intrusions. We start with an extension of the notion of the many-typed signature to the generalised signature and we construct the category of packets as a basic structure of our approach. A defined endofunctor captures the expected behaviour of the packet stream. The constructed coalgebra enables the description of the behaviour of the packet stream together with the reaction to intrusions.
[1] Dmitry S. Kazachkin,et al. Network traffic analysis optimization for signature-based intrusion detection systems , 2008 .
[2] Michael Barr,et al. Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.
[3] Ichiro Hasuo. Modal Logics for Coalgebras -A Survey , 2004 .