Process tree-based analysis method of DECLARE relation constraints in acyclic bridge-less well-structured workflow nets
2019 ◽
Vol 13
(2)
◽
pp. 104-111
Keyword(s):
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.
2020 ◽
Vol ahead-of-print
(ahead-of-print)
◽
1983 ◽
Vol 15
(04)
◽
pp. 752-768
◽
1953 ◽
Vol 245
(900)
◽
pp. 429-468
◽
2012 ◽
Vol 22
(07)
◽
pp. 1250056
◽