A Computational Model of Computer Worms based on Persistent Turing Machines
The traditional Turing machines (TMs) are not suitable for modeling interactive computation. Persistent Turing machines (PTMs) are a canonical model for sequential interaction and are equivalent to sequential interaction machines (SIMs) in expressiveness. Naturally it can be used to model computer worm agents that interact with external network environments in a sequential way abstractly. In the paper a computational model of worms based on PTMs is developed which reveals the infection, evolution and interaction abilities of worms quite well. Some relevant theorems about worms are also deduced according to the worm model. The model overcomes the inherent deficiency of 7M virus models in describing interaction and covers entirely all cur-rent worms since it adequately reveals the essential abilities of worms.
Persistent Turing machine worm infection evolution interaction.
Jingbo Hao Jianping Yin Boyun Zhang
School of Computer Science, National University of Defense Technology, Changsha, China
国际会议
Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)
北京
英文
453-456
2006-07-17（万方平台首次上网日期，不代表论文的发表时间）