Niels Lohmann. Fixing deadlocking service choreographies using a simulation-based graph edit distance. In Monika Solanki, Barry Norton, and Stephan Reiff-Marganiec, editors, 3rd Young Researchers Workshop on Service Oriented Computing (YR-SOC 2008), pages 13-20, June 2008.

• paper by Niels Lohmann¹⁾
• presented on 12 June 2008 at YR-SOC 2008 by Niels Lohmann

Many work has been conducted to analyze services and 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.

• Paper
• Slides

The presented experiments have been conducted with Rachel Version 1.00 using the following command:

rachel -a service.sa -o service.og -m matching

where service.sa is a service automaton and service.og is an operating guideline. You can download the example files used in the paper.

On an Apple MacBook (Intel Core 2 Duo, 2.16 GHz, 2 GB RAM, Mac OS X 10.5.2, g++ 4.0.1), we came to the following results:

• Rachel (to calculate the edit distance between a service automaton and an operating guideline)
• Fiona (to calculate the operating guideline for a service, and to synthesize a partner for a service)

@inproceedings{Lohmann_2008_yrsoc,
Author = {Niels Lohmann},
Booktitle = {3rd Young Researchers Workshop on Service Oriented Computing (YR-SOC 2008)},
Editor = {Monika Solanki and Barry Norton and Stephan Reiff-Marganiec},
Month = jun,
Pages = {13-20},
Title = {Fixing Deadlocking Service Choreographies Using a Simulation-based Graph Edit Distance},
Year = {2008}}