Service Discovery Using Communication Fingerprints

A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compatibility. In the case of stateful services, there is the additional need to check behavioral (i.e. protocol) compatibility. This paper is concerned with the latter aspect. For speeding up compatibility checks which need to be performed on many candidate services, we propose an abstraction of the behavior of each published service that we call communication fingerprint. The technique is based on linear programming and is thus extremely efficient. We validate our approach on a large set of services that we cut out of real world business processes.

[1]  Wil M. P. van der Aalst,et al.  Transactions on Petri Nets and Other Models of Concurrency II, Special Issue on Concurrency in Process-Aware Information Systems , 2009, Trans. Petri Nets and Other Models of Concurrency.

[2]  A. J. Jex-Blake “Et. all” , 1952 .

[3]  Karsten Wolf,et al.  Does My Service Have Partners? , 2009, Trans. Petri Nets Other Model. Concurr..

[4]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[5]  Wil M. P. van der Aalst,et al.  Matching observed behavior and modeled behavior: An approach based on Petri nets and integer programming , 2006, Decis. Support Syst..

[6]  Olivia Oanea,et al.  Decomposition into open nets , 2009 .

[7]  Olivia Oanea,et al.  An efficient necessary condition for compatibility , 2009, ZEUS.

[8]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[9]  Karsten Wolf,et al.  Verifying Deadlock- and Livelock Freedom in an SOA Scenario , 2009, 2009 Ninth International Conference on Application of Concurrency to System Design.

[10]  H. P. Williams THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[11]  Kathrin Kaschner,et al.  Set Algebra for Service Behavior: Applications and Constructions , 2009, BPM.

[12]  Stephan Merz,et al.  Model Checking , 2000 .

[13]  Mathias Weske,et al.  Change Propagation in Process Models Using Behavioural Profiles , 2009, 2009 IEEE International Conference on Services Computing.

[14]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[15]  Dmitry A. Zaitsev,et al.  Compositional analysis of Petri nets , 2006 .

[16]  Jordi Cortadella,et al.  The octahedron abstract domain , 2004, Sci. Comput. Program..

[17]  Andrew D. Gordon,et al.  Verified Reference Implementations of WS-Security Protocols , 2006, WS-FM.

[18]  Dirk Fahland,et al.  Instantaneous Soundness Checking of Industrial Business Process Models , 2009, BPM.

[19]  Jan Sürmeli,et al.  Pro ling Services with Static Analysis , 2009 .

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

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

[22]  Mathias Weske,et al.  Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition , 2010, Petri Nets.