Skip to main content
SpringerLink
Log in

Control Flow Structure Preservation During Process Fragment Anonymization

(Short Paper)

  • Conference paper
  • First Online:
On the Move to Meaningful Internet Systems. OTM 2017 Conferences (OTM 2017)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10573))

  • 1603 Accesses

Abstract

Existing process anonymization work does not yet support control flow anonymization. However, as the control flow is one core component of business processes and represents confidential information, this can result in an information leakage. Hence, a control flow anonymization approach is proposed. It merges multiple control flows from the same process collection to minimize the similarity between the original and the anonymized one. At the same time, the original control flow structure is preserved to foster the representativity of the anonymized flows. The approach is prototypically implemented and evaluated with 10, 987 business process models from multiple process collections.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Becker, M., Laue, R.: A comparative survey of business process similarity measures. Comput. Ind. 63(2), 148–167 (2012)

    Article  Google Scholar 

  2. Böhmer, K., Rinderle-Ma, S.: Difference-preserving process merge. In: Demey, Y.T., Panetto, H. (eds.) OTM 2013. LNCS, vol. 8186, pp. 718–721. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41033-8_92

    Chapter  Google Scholar 

  3. Cordella, L.P., et al.: A (sub) graph isomorphism algorithm for matching large graphs. Pattern Anal. Mach. Intell. 26(10), 1367–1372 (2004)

    Article  Google Scholar 

  4. Dijkman, R., et al.: Similarity of business process models: metrics and evaluation. Inf. Syst. 36(2), 498–516 (2011)

    Article  Google Scholar 

  5. Dumas, M., et al.: Fast detection of exact clones in business process model repositories. Inf. Syst. 38(4), 619–633 (2013)

    Article  Google Scholar 

  6. Ekanayake, C.C., Dumas, M., García-Bañuelos, L., La Rosa, M., ter Hofstede, A.H.M.: Approximate clone detection in repositories of business process models. In: Barros, A., Gal, A., Kindler, E. (eds.) BPM 2012. LNCS, vol. 7481, pp. 302–318. Springer, Heidelberg (2012). doi:10.1007/978-3-642-32885-5_24

    Chapter  Google Scholar 

  7. Gao, X., et al.: Process model fragmentization, clustering and merging: an empirical study. In: Lohmann, N., Song, M., Wohed, P. (eds.) BPM 2013. LNBIP, vol. 171, pp. 405–416. Springer, Cham (2014). doi:10.1007/978-3-319-06257-0_32

    Chapter  Google Scholar 

  8. Ivanov, S., Kalenkova, A., van der Aalst, W.M.: Bpmndiffviz: a tool for bpmn models comparison. In: BPM (Demos), pp. 35–39 (2015)

    Google Scholar 

  9. Kasiviswanathan, S.P., Nissim, K., Raskhodnikova, S., Smith, A.: Analyzing graphs with node differential privacy. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 457–476. Springer, Heidelberg (2013). doi:10.1007/978-3-642-36594-2_26

    Chapter  Google Scholar 

  10. La Rosa, M., Reijers, H.A., Van Der Aalst, W.M., Dijkman, R.M., Mendling, J., Dumas, M., GarcíA-BañUelos, L.: Apromore: an advanced process model repository. Expert Syst. Appl. 38(6), 7029–7040 (2011)

    Article  Google Scholar 

  11. La Rosa, M., et al.: Business process model merging: an approach to business process consolidation. TOSEM 22(2), 11: 1–11: 42 (2013)

    Article  Google Scholar 

  12. La Rosa, M., et al.: Detecting approximate clones in business process model repositories. Inf. Syst. 49, 102–125 (2015)

    Article  Google Scholar 

  13. Martínez, C., Valiente, G.: An algorithm for graph pattern-matching. Workshop String Process. 8, 180–197 (1997)

    Google Scholar 

  14. Pietsch, P., Wenzel, S.: Comparison of BPMN2 diagrams. In: Mendling, J., Weidlich, M. (eds.) BPMN 2012. LNBIP, vol. 125, pp. 83–97. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33155-8_7

    Chapter  Google Scholar 

  15. Pittke, F., Leopold, H., Mendling, J., Tamm, G.: Enabling reuse of process models through the detection of similar process parts. In: La Rosa, M., et al. (eds.) BPM 2012. LNBIP, vol. 132, pp. 586–597. Springer, Heidelberg (2013). doi:10.1007/978-3-642-36285-9_59

    Chapter  Google Scholar 

  16. Skouradaki, M., Göerlach, K., Hahn, M., Leymann, F.: Application of sub-graph isomorphism to extract reoccurring structures from BPMN 2.0 process models. In: Service-Oriented System Engineering, pp. 11–20 (2015)

    Google Scholar 

  17. Skouradaki, M., Leymann, F., Nikolaou, C., Leymann, F.: Detecting frequently recurring structures in BPMN 2.0. In: SummerSOC 2015, pp. 102–116 (2015)

    Google Scholar 

  18. Skouradaki, M., Roller, D., Pautasso, C., Leymann, F.: “BPELanon”: anonymizing BPEL processes. In: Services and their Composition (2014)

    Google Scholar 

  19. Skouradaki, M., et al.: On the road to benchmarking BPMN 2.0 workflow engines. In: Performance Engineering, pp. 301–304 (2015)

    Google Scholar 

  20. Skouradaki, M., Andrikopoulos, V., Kopp, O., Leymann, F.: RoSE: reoccurring structures detection in BPMN 2.0 process model collections. In: Debruyne, C., et al. (eds.) COOPIS 2016. LNCS, pp. 263–281. Springer, Cham (2016). doi:10.1007/978-3-319-48472-3_15

    Google Scholar 

  21. Ullmann, J.R.: An algorithm for subgraph isomorphism. JACM 23(1), 31–42 (1976)

    Article  MathSciNet  Google Scholar 

  22. Van Dongen, B., Dijkman, R., Mendling, J.: Measuring similarity between business process models. In: Information Systems Engineering, pp. 405–419. Springer (2013)

    Google Scholar 

  23. Muehlen, M., Recker, J.: How much language is enough? theoretical and practical use of the business process modeling notation. In: Bellahsène, Z., Léonard, M. (eds.) CAiSE 2008. LNCS, vol. 5074, pp. 465–479. Springer, Heidelberg (2008). doi:10.1007/978-3-540-69534-9_35

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, University of Vienna, Vienna, Austria

    Kristof Böhmer & Stefanie Rinderle-Ma

Authors
  1. Kristof Böhmer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefanie Rinderle-Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kristof Böhmer .

Editor information

Editors and Affiliations

  1. University of Lorraine, Nancy, France

    Hervé Panetto

  2. Odisee University College, Brussels, Belgium

    Christophe Debruyne

  3. Télécom SudParis, Évry, France

    Walid Gaaloul

  4. Tilburg University, Tilburg, The Netherlands

    Mike Papazoglou

  5. Freie Universität Berlin and Fraunhofer FOKUS, Berlin, Germany

    Adrian Paschke

  6. Università degli Studi di Milano, Crema, Italy

    Claudio Agostino Ardagna

  7. TU Graz, Graz, Austria

    Robert Meersman

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Böhmer, K., Rinderle-Ma, S. (2017). Control Flow Structure Preservation During Process Fragment Anonymization. In: Panetto, H., et al. On the Move to Meaningful Internet Systems. OTM 2017 Conferences. OTM 2017. Lecture Notes in Computer Science(), vol 10573. Springer, Cham. https://doi.org/10.1007/978-3-319-69462-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69462-7_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69461-0

  • Online ISBN: 978-3-319-69462-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation