Formal analysis approach on networks with dynamic behaviours

Formal verification and validation techniques such as model checking are not widely used in computer networks. These methods are very useful to identify configuration errors, identify design problems and predict network behaviours under different network conditions. This paper describes the two main components of the formal verification process, formal modelling and the analysis process. For formal modelling, computer networks configured with dynamic routing protocols such as RIP, OSFP or EIGRP are considered. For the analysis, reachability and security properties are evaluated as the behavioural properties in the case of device or link failures. Graph Theory is used to implement the model and predict the network behaviours. The process of building the model, grouping the network states which have common behaviours and predicting behaviours are the core work of this paper. Furthermore this paper details a method to reduce the state space and hence eliminate the state space explosion.