Please use this identifier to cite or link to this item:
Title: The Application of Decidability Theory in Identifying Similar Computer Networks
Authors: Abdulhamid, Shafi’i Muhammad
Waziri, Victor O.
Idris, Laminu
Keywords: Computer network
Transition table
Finite Automata (FA)
Issue Date: 13-Oct-2011
Publisher: The IUP Journal of Computational Mathematics
Series/Report no.: 4 (2), 1-11;
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.
Appears in Collections:Cyber Security Science

Files in This Item:
File Description SizeFormat 
46.pdfThe Application of Decidability Theory in Identifying Similar Computer Networks245.03 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.