The Application of Decidability Theory in Identifying Similar Computer Networks

Abstract

Recent decades have seen a remarkable development in the use of computer systems and computer networks. With their advances our reliance on hardware and software has amplified, and so has our susceptibility to their malfunction. For fear of any major network failure, it is at all times good to recognize similar networks so that switching can be done to reduce damages. Theoretical computer science aims to model and understand the intricacy of computer systems, and thereby creates the basis for their formal verification: to mathematically prove that a system satisfies its requirement. In this paper, the decidability theory is theoretically applied to identify/decide if two different computer networks are similar (in terms of efficiency, high performance computing and scalability) or not. A finite automata is designed for each network and two different scenarios are considered for demonstration. The results show that the theory can be effectively used to make such comparisons between different computer networks.