Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance

  • Authors:
  • Niels Lohmann

  • Affiliations:
  • Institut für Informatik, Universität Rostock, Rostock, Germany 18051

  • Venue:
  • BPM '08 Proceedings of the 6th International Conference on Business Process Management
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detectedautomatically, the correctionof defective services is usually done manually. This paper introduces a graph-based approach to calculate the minimal edit distance between a given defective service and synthesized correct services. This edit distance helps to automatically fix found errors while keeping the rest of the service untouched. A prototypic implementation shows that the approach is applicable to real-life services.