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

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.

[1]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  Kedar S. Namjoshi.  A Simple Characterization of Stuttering Bisimulation , 1997, FSTTCS.

[3]  Zhaohui Wu,et al.  Similarity-based Web service matchmaking , 2005, 2005 IEEE International Conference on Services Computing (SCC'05) Vol-1.

[4]  Antonio Brogi,et al.  Automated Generation of BPEL Adapters , 2006, CIbSE.

[5]  Fabio Casati,et al.  Semi-automated adaptation of service interactions , 2007, WWW '07.

[6]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[7]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[8]  Stefanie Rinderle-Ma,et al.  Change Patterns and Change Support Features in Process-Aware Information Systems , 2007, Seminal Contributions to Information Systems Engineering.

[9]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[11]  Jetty Kleijn,et al.  Petri Nets and Other Models of Concurrency - ICATPN 2007, 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings , 2007, ICATPN.

[12]  Mike P. Papazoglou,et al.  Agent-oriented technology in support of e-business , 2001, CACM.

[13]  Philippe Darondeau,et al.  Theory of Regions , 1996, Petri Nets.

[14]  Gregor Engels,et al.  Detecting and Resolving Process Model Differences in the Absence of a Change Log , 2008, BPM.

[15]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[16]  Remco M. Dijkman.  Diagnosing Differences between Business Process Models , 2008, BPM.

[17]  Winfried Lamersdorf,et al.  Service-Oriented Computing - ICSOC 2006, 4th International Conference, Chicago, IL, USA, December 4-7, 2006, Proceedings , 2006, ICSOC.

[18]  Daniela Grigori,et al.  BPEL Processes Matchmaking for Service Discovery , 2006, OTM Conferences.

[19]  Francisco Curbera,et al.  Web Services Business Process Execution Language Version 2.0 , 2007 .

[20]  Niels Lohmann,et al.  Operating Guidelines for Finite-State Services , 2007, ICATPN.

[21]  Niels Lohmann,et al.  Fully-automatic Translation of Open Workflow Net Models into Simple Abstract BPEL Processes , 2008, Modellierung.

[22]  Niels Lohmann,et al.  A Feature-Complete Petri Net Semantics for WS-BPEL 2.0 , 2007, WS-FM.

[23]  Alex Groce,et al.  SPECIAL S ECTION O N T OOLS A ND A LGORITHMS F OR THE C ONSTRUCTION A ND A NALYSIS O F S YSTEMS , 2005 .

[24]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[25]  Remco M. Dijkman,et al.  Service-Oriented Design: A Multi-Viewpoint Approach , 2004, Int. J. Cooperative Inf. Syst..

[26]  Chengfei Liu,et al.  Version Management in the Business Process Change Context , 2007, BPM.

[27]  Marlon Dumas,et al.  Adapt or Perish: Algebra and Visual Notation for Service Interface Adaptation , 2006, Business Process Management.

[28]  A Min Tjoa,et al.  E-Commerce and Web Technologies , 2002, Lecture Notes in Computer Science.

[29]  Mathias Weske,et al.  BPEL4Chor: Extending BPEL for Modeling Choreographies , 2007, IEEE International Conference on Web Services (ICWS 2007).

[30]  Peter Massuthe,et al.  Operating guidelines for services , 2009 .

[31]  Wolfgang Reisig,et al.  Analyzing BPEL4Chor: Verification and Participant Synthesis , 2007, WS-FM.

[32]  Niels Lohmann,et al.  Analyzing Interacting BPEL Processes , 2006, Business Process Management.

[33]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[34]  Mehrdad Sabetzadeh,et al.  Matching and Merging of Statecharts Specifications , 2007, 29th International Conference on Software Engineering (ICSE'07).

[35]  Pinar Yolum,et al.  Structural and Semantic Similarity Metrics for Web Service Matchmaking , 2007, EC-Web.

[36]  Zahir Tari,et al.  On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE, OTM Confederated International Conferences, CoopIS, DOA, GADA, and ODBASE 2006, Montpellier, France, October 29 - November 3, 2006. Proceedings, Part I , 2006, OTM Conferences.

[37]  Remco M. Dijkman.  A Classification of Differences between Similar BusinessProcesses , 2007, 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007).

[38]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[39]  Insup Lee,et al.  Simulation-Based Graph Similarity , 2006, TACAS.

[40]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[41]  Valeria De Antonellis,et al.  Evaluating Similarity and Difference in Service Matchmaking , 2006, EMOI-INTEROP.

[42]  Karsten Schmidt,et al.  Controllability of Open Workflow Nets. , 2005 .