Gero Decker, Alistair Barros, Frank Michael Kraft, and Niels Lohmann. Non-desynchronizable service choreographies. In Athman Bouguettaya, Ingolf H. Krueger, and Tiziana Margaria, editors, Service-Oriented Computing – ICSOC 2008, Sixth International Conference, Sydney, Australia, December 1–5, 2008, Proceedings, Lecture Notes in Computer Science. Springer-Verlag, December 2008.
A non-desynchronizable choreography.
Abstract. A precise definition of interaction behavior between services is a prerequisite for successful business-to-business integration. Service choreographies provide a view on message exchanges and their ordering constraints from a global perspective. Assuming message sending and receiving as one atomic step allows to reduce the modelers’ effort. As downside, problematic race conditions resulting in deadlocks might appear when realizing the choreography using services that exchange messages asynchronously. This paper presents typical issues when desynchronizing service choreographies. Solutions from practice are discussed and a formal approach based on Petri nets is introduced for identifying desynchronizable choreographies.
Niels Lohmann. Decompositional calculation of operating guidelines using free choice conflicts. In Niels Lohmann and Karsten Wolf, editors, 15th German Workshop on Algorithms and Tools for Petri Nets, AWPN 2008, Rostock, Germany, September 26–27, 2008, Proceedings, volume 380 of CEUR Workshop Proceedings, pages 48–53. CEUR-WS.org, September 2008.
product operating guideline
Abstract. An operating guideline (OG) for a service S finitely characterizes the (possibly infinite) set of all services that can interact with S without deadlocks. This paper presents a decompositional approach to calculate an OG for a service whose underlying structure is acyclic and contains free-choice conflicts. This divide-and-conquer approach promises to be more efficient than the classical OG computation algorithm.
Niels Lohmann. Why does my service have no partners? In Roberto Bruni and Karsten Wolf, editors, Web Services and Formal Methods, Fifth International Workshop, WS-FM 2008, Milan, Italy, September 4–5, 2008, Proceedings, Lecture Notes in Computer Science. Springer-Verlag, September 2008.
uncontrollable open net
Abstract. Controllability is a fundamental correctness criterion for interacting service models. A service model is controllable if there exists a partner service such that their composition is free of deadlocks and livelocks. Whereas controllability can be automatically decided, the existing decision algorithm gives no information about the reasons of why a service model is uncontrollable. This paper introduces a diagnosis framework to find these reasons which can help to fix uncontrollable service models.
Niels Lohmann. Correcting deadlocking service choreographies using a simulation-based graph edit distance. In Marlon Dumas, Manfred Reichert, and Ming-Chien Shan, editors, Business Process Management, 6th International Conference, BPM 2008, Milan, Italy, September 1–4, 2008, Proceedings, volume 5240 of Lecture Notes in Computer Science, pages 132–147. Springer-Verlag, September 2008.
finding the most similar correct service
Abstract. 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.
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), June 2008.
Abstract. 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.
letzte Kommentare