Complexity Reduction in Finite State Automata Explosion of Networked System Diagnosis

This research puts forward the rough finite state automata which have been represented by two variants of binary decision diagram (bdd) called robdd and zbdd, for networked system diagnosis. using the suggested data structures can help us overcome the combinatorial explosion which usually occurs in system diagnosis. in implementations and analysis of our experimental results, we used cudd-colorado university decision diagram package. a mathematical proof for the claimed complexity is provided which shows that zbdd representation has superiority in space and time complexity to robdd representation.