Execution Semantics of Parallel Finite Automata

Parallel finite automata is an extended finite status machine and it is suitable for characterizing of concurrent and synchronization task. Based on the workflow modeling, this paper defines some concepts of PFA and describes table and diagram representation of node transition function and state transition function which are the main components of FPA. The former expresses static structure of PFA, and the latter expresses dynamitic behavior of PFA. In order to grasp the language PFA can recognize, in the end, this paper presents the execution process of PFA, and formalizes some concepts about PFA execution semantics, which are configuration, triggering transition, consistent transition and enabled transition set. After model and execution semantics were built up, it have laid the basis for the analysis of static and dynamic properties of PFA, and have done the preparation for the construction language PFA can recognize in further research.