Academic
Publications
Combining a Reachability Graph and a Reduction Rule Approach for Verification of EPCs

Combining a Reachability Graph and a Reduction Rule Approach for Verification of EPCs,Jan Mendling

Combining a Reachability Graph and a Reduction Rule Approach for Verification of EPCs  
BibTex | RIS | RefWorks Download
This demonstration shows how two complementary tools can be com- bined for the efficient verification of EPC business process models. In a first step, the tool xoEPC is used to identify control-flow errors in an EPC based on reduc- tion rules. While this approach is efficient, it may result in a partially reduced EPC since the set of reduction rules is not complete. In a second step, this par- tially reduced EPC can then be loaded into ProM. In ProM there is a conversion plug-in that calculates the reachability graph and verifies EPC soundness. Though this approach is complete, it can be quite time-consuming. Using the two tools in sequence balances efficient processing of the reduction rules approach and the completeness of the reachability graph analysis.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.