Advertisement

On Predicting Impacts of Customizations to Standard Business Processes

  • Pietro Mazzoleni
  • Aubrey Rembert
  • Rama Akkiraju
  • Rong (Emily) Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6470)

Abstract

Adopting standard business processes and then customizing them to suit specific business requirements is a common business practice. However, often, organizations don’t fully know the impact of their customizations until after processes are implemented. In this paper, we present an algorithm for predicting the impact of customizations made to standard business processes by leveraging a repository of similar customizations made to the same standard processes. For a customized process whose impact needs to be predicted, similar impact trees are located in a repository using the notion of impact nodes. The algorithm returns a ranked list of impacts predicted for the customizations.

Keywords

Process Re-engineering Process Comparison Best practices Tree Comparison 

References

  1. 1.
    Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science 337(1-3), 217–239 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Dijkman, R., Dumas, M., Garcıa-Banuelos, L.: Graph matching algorithms for business process model similarity search. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) Business Process Management. LNCS, vol. 5701, pp. 48–63. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Eshuis, R., Grefen, P.: Structural matching of BPEL processes. In: Fifth European Conference on Web Services, ECOWS 2007, pp. 171–180 (2007)Google Scholar
  4. 4.
    Hallerbach, A., Bauer, T., Reichert, M.: Managing process variants in the process lifecycle. In: ICEIS 2008 (2008)Google Scholar
  5. 5.
    Johnson, R., Pearson, D., Pingali, K.: The program structure tree: Computing control regions in linear time. In: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation, pp. 171–185. ACM, New York (1994)CrossRefGoogle Scholar
  6. 6.
    Johnson, R.C.: Efficient program analysis using dependence flow graphs (1995)Google Scholar
  7. 7.
    Küster, J.M., Gerth, C., Förster, A., Engels, G.: Detecting and resolving process model differences in the absence of a change log. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 244–260. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Pietro Mazzoleni
    • 1
  • Aubrey Rembert
    • 1
  • Rama Akkiraju
    • 1
  • Rong (Emily) Liu
    • 1
  1. 1.IBM T.J. Watson research CenterUSA

Personalised recommendations