Implicit Places and Refactoring in Sound Acyclic Extended Free Choice Workflow Nets

Ichiro TOYOSHIMA  Shingo YAMAGUCHI  Jia ZHANG  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E99-A   No.2   pp.502-508
Publication Date: 2016/02/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E99.A.502
Type of Manuscript: Special Section PAPER (Special Section on Mathematical Systems Science and its Applications)
Category: 
Keyword: 
workflow net,  implicit place,  refactoring,  extended free choice WF-net,  well-structured WF-net,  branching bisimilarity,  

Full Text: PDF(1.5MB)
>>Buy this Article


Summary: 
Workflow nets (WF-nets for short) are a mathematical model of real world workflows. A WF-net is often updated in accordance with the change of real world. This may cause places that are redundant from the viewpoint of the behavior. Such places are called implicit. We first proposed a necessary and sufficient condition to find implicit places. Then we proved that removing of implicit places is a reduction operation which forms branching bisimilarity. We also constructed an algorithm for the reduction. Next, we applied the proposed reduction operation to WF-net refactoring. Then we showed the usefulness of the proposed refactoring with two examples.