Business Process Management

Volume 5240 of the series Lecture Notes in Computer Science pp 132-147

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

  • Niels LohmannAffiliated withInstitut für Informatik, Universität Rostock

* Final gross prices may vary according to local VAT.

Get Access


Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of 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.


Choreographies graph correction correction of services verification of services service automata operating guidelines BPEL