Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application

2015 ◽  
Vol E98.A (2) ◽  
pp. 635-644 ◽  
Author(s):  
Ichiro TOYOSHIMA ◽  
Shingo YAMAGUCHI ◽  
Yuki MURAKAMI
Keyword(s):  
Free Choice ◽  
Sufficient Conditions ◽  
Workflow Nets

scholarly journals Polynomial analysis algorithms for free choice Probabilistic Workflow Nets

2017 ◽  
Vol 117 ◽  
pp. 104-129 ◽  
Author(s):  
Javier Esparza ◽  
Philipp Hoffmann ◽  
Ratul Saha
Keyword(s):  
Free Choice ◽  
Workflow Nets

scholarly journals Process tree-based analysis method of DECLARE relation constraints in acyclic bridge-less well-structured workflow nets

2019 ◽  
Vol 13 (2) ◽  
pp. 104-111
Author(s):  
Shingo Yamaguchi ◽  
Mohd Anuaruddin Bin Ahmadon
Keyword(s):  
Polynomial Time ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Analysis Method ◽  
Declarative Language ◽  
Tree Representation ◽  
Workflow Nets ◽  
Necessary And Sufficient ◽  
The Relationship ◽  
Process Tree

In this paper, we proposed a method to analyze workflows’ constraints whose templates are defined in a declarative language called DECLARE. Checking such constraints is important but known to be intractable in general. Our results show three things. First, utilizing a tree representation of workflow process called {\it process tree}, we provided necessary and sufficient conditions on the constraints. Second, those conditions enable us to not only check a given constraint in polynomial time but also find a clue for improving the net if it violates the constraint. Third, we revealed the relationship among the constraint templates.

Sign in / Sign up

Export Citation Format

Share Document