2009 IEEE International Conference on
Systems, Man, and Cybernetics |
![]() |
Abstract
This paper presents a method for the qualitative analysis of WorkFlow nets based on the proof trees of linear logic. The analysis is concerned with the proof of the Soundness correctness criterion defined for WorkFlow nets. To prove the Soundness property, a proof tree of linear logic is built for each different scenario of the WorkFlow net. Based on this approach, a method is proposed to verify in linear time if the WorkFlow net is sound.