Detecting Infeasible Traces in Process Models

Zhaoxia Wang, Lijie Wen, Xiaochen Zhu, Yingbo Liu, Jianmin Wang

Abstract

Workflow testing is an important method of workflow analysis in design time. A challenging problem with trace-oriented test data generation in particular and trace-based workflow analysis in general is the existence of infeasible traces for which there is no input data for them to be executed. In this paper we build on the theory of workflow nets and introduce workflow nets where transitions have conditions associated with them. We then demonstrate that we can determine which execution traces, that are possible according to the controlflow dependencies, are actually possible taking the data perspective into account. This way we are able to more accurately determine in design time the infeasible traces caused by the correlation between transition conditions along this trace. Finally, we provide a solution to automatically detecting the shortest infeasible trace.

References

  1. Finkel, A. (1991). The minimal coverability graph for petri nets. In Rozenberg, G., editor, Applications and Theory of Petri Nets, volume 674 of Lecture Notes in Computer Science, pages 210-243. Springer.
  2. Murata, T. (1989). Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE, 77(4):541-580.
  3. Ngo, M. N. and Tan, H. B. K. (2008). Heuristics-based infeasible path detection for dynamic test data generation. Inf. Softw. Technol., 50(7-8):641-655.
  4. Trc?ka, N., van der Aalst, W., and Sidorova, N. (2009). Dataflow anti-patterns: Discovering data-flow errors in workflows. In van Eck, P., Gordijn, J., and Wieringa, R., editors, Advanced Information Systems Engineering, 21st International Conference, CAiSE 2009, Amsterdam, The Netherlands, June 8-12, 2009. Proceedings, volume 5565 of Lecture Notes in Computer Science, pages 425-439. Springer-Verlag.
  5. van der Aalst, W. (1998). The application of Petri nets to workflow management. Journal of Circuits, Systems, and Computers, 8(1):21-66.
  6. van der Aalst, W. and ter Hofstede, A. H. M. (2000). Verification of workflow task structures: A Petri-net-baset approach. Inf. Syst., 25(1):43-69.
  7. van der Aalst, W., van Dongen, B., G√ľnther, C., Rozinat, A., Verbeek, H., and Weijters, A. (2009). ProM: The process mining toolkit. In de Medeiros, A. and Weber, B., editors, Proceedings of the Business Process Management Demonstration Track (BPMDemos 2009), Ulm, Germany, September 8, 2009, volume 489 of CEUR Workshop Proceedings. CEUR-WS.org.
Download


Paper Citation


in Harvard Style

Wang Z., Wen L., Zhu X., Liu Y. and Wang J. (2012). Detecting Infeasible Traces in Process Models . In Proceedings of the 14th International Conference on Enterprise Information Systems - Volume 3: ICEIS, ISBN 978-989-8565-12-9, pages 212-217. DOI: 10.5220/0003989002120217


in Bibtex Style

@conference{iceis12,
author={Zhaoxia Wang and Lijie Wen and Xiaochen Zhu and Yingbo Liu and Jianmin Wang},
title={Detecting Infeasible Traces in Process Models},
booktitle={Proceedings of the 14th International Conference on Enterprise Information Systems - Volume 3: ICEIS,},
year={2012},
pages={212-217},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003989002120217},
isbn={978-989-8565-12-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 14th International Conference on Enterprise Information Systems - Volume 3: ICEIS,
TI - Detecting Infeasible Traces in Process Models
SN - 978-989-8565-12-9
AU - Wang Z.
AU - Wen L.
AU - Zhu X.
AU - Liu Y.
AU - Wang J.
PY - 2012
SP - 212
EP - 217
DO - 10.5220/0003989002120217