色付き有限オートマトンの侵入検知システムへの応用

Read full text Summarise with VIRAT
Authors: 拓海 藤本, 芳明 高橋
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

In recent years, colored finite automata (CFA), an extension of finite automata, have been proposed, and we are investigating their application to intrusion detection systems (IDS). By assigning “colors” to states, CFAs enable more detailed and multi-layered input identification beyond the binary accept/reject decisions of conventional automata. This research first implements an IDS utilizing these CFA. Subsequently, we aim to evaluate its attack detection accuracy using experimental data and demonstrate the usefulness of CFA-based IDS.

Fields of Study & Subjects

Network Security and Intrusion Detection Network Packet Processing and Optimization Artificial Immune Systems Applications

Publication details

Journal / source
Institutional Repositories DataBase (IRDB)
Volume
58
Pages
1–7
Publication date
1 March 2026
Language
EN