An Algorithm for Checking the Regularity of Flow Nets

Regular flow nets, extended from Petri nets and YAWL, have been presented as bases for modeling web service behavior because of their abilities for dealing with cyclic services and data dependences among services. However, the corresponding approach on how to check the regularity of a flow net has not been given yet. So, in this paper we propose a methodology for checking the regularity of flow nets. Firstly, we introduce some definitions related to flow nets and regular flow nets. Secondly, we motivate the definitions and theorems for checking the regularity of flow nets which are used to construct the corresponding algorithm. Finally, we propose an algorithm which solves the problem perfectly.