Loading...
Please wait, while we are loading the content...
Process Tree-based Analysis Method of DECLARE Relation Constraints in Acyclic Bridge-less Well-structured Workflow Nets
| Content Provider | Semantic Scholar |
|---|---|
| Author | Yamaguchi, Shingo Anuaruddin, Mohd Ahmadon, Bin |
| Copyright Year | 2019 |
| Abstract | 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 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. |
| File Format | PDF HTM / HTML |
| DOI | 10.37936/ecti-cit.2019132.203107 |
| Alternate Webpage(s) | https://ph01.tci-thaijo.org/index.php/ecticit/article/download/203107/153491 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
