The Redundancy Problem in Composition of Parallel Finite Automata and Its Optimization Method

Abstract

Parallel finite automata is a formal model which can describe the complex control structure, but its composition model may exist redundant elements. This problem will increase the complexity of model. This paper researched the redundancy problem in the Split-Join composition of parallel finite automata and gave the condition which lead to produce redundant location and transfer. Furthermore, the algorithms which are used to eliminate the redundant location and transfer also was given. Finally, it proved the equivalence of parallel finite automata and finite automata. This conclusion ensures that he verification technology of system which base on the finite automata can be used to parallel finite automata by extension.