Rule Checking in Process Models using Taint Flow Analysis
Checking certain business rules in process models (e.g. petri-nets, BPMN or flow graphs) is usually done using a model checker or an automata. Increasing models and the increasing amount of rules lead to long computation times. The Taint Flow Analysis operates on graphs to determine certain flows (source to sink). With a neat conversion of rules we can check business rules on flow graphs very efficiently. However, the current approach is limited.
Due to the low expressiveness of flow graphs the current approach is very limited and existing process models need to be converted into a flow graph. The goal of this thesis is to modify the existing algorithm to work with higher level process models which contain AND and OR gates. The rule checking should be extended such that a broader range of business rules can be checked.
At the end of the thesis the Taint Flow Analysis algorithm works with process models and considers AND or OR-gates correctly. In addition to that a broader range of business rules can be checked by adjusting the algorithm to deal with rule states.
- Alexander Seeliger (seeliger(a-t)tk.tu-darmstadt.de)