This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD representing has superiority in space and time complexity to ROBDD representing.
Ghasemzadeh, M. (2014). Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE). International Journal of Engineering, 27(1), 29-32.
MLA
Mohammad Ghasemzadeh. "Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)". International Journal of Engineering, 27, 1, 2014, 29-32.
HARVARD
Ghasemzadeh, M. (2014). 'Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)', International Journal of Engineering, 27(1), pp. 29-32.
VANCOUVER
Ghasemzadeh, M. Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE). International Journal of Engineering, 2014; 27(1): 29-32.
)