Verification of EPCs based on the Finite State Automata and state-space

Event-driven process chains (EPCs) have become a widespread process modeling technique because of their agility and simple. But they also have serious drawback, such as the informal semantics of EPCs that resulted in the process reengineering based on EPC canpsilat be implemented automatically. This paper aims at the automatic reengineering of process, adopts the FSA (finite state automata) theory, and indicates an arithmetic based on state-space, for the purpose of implement automatic verification of EPCs, then the operational staff can do the process reengineering by themselves. Process reengineering is based on EPC. Aims at the EPC which has been gained, first, it is reduced using universally accepted reduction rules. Second, the reduced EPC is analyzed using a mixture of state-space analysis, automata theory, and human judgment, then the arithmetic is implemented.