Protocol-Level Service Composition Mismatches: A Petri Net Siphon Based Solution

Protocol-Level Service Composition Mismatches: A Petri Net Siphon Based Solution

PengCheng Xiong (Georgia Institute of Technology, USA), Calton Pu (Georgia Institute of Technology, USA) and Mengchu Zhou (New Jersey Institute of Technology, USA)
Copyright: © 2010 |Pages: 20
DOI: 10.4018/jwsr.2010100101
OnDemand PDF Download:
No Current Special Offers


Protocol-level mismatch is one of the most important problems in service composition. The state-of-the-art method to deal with protocol mismatch is to generate adaptors to check deadlock-freeness based on a reachability graph. When this property is violated, the generation process will repeat itself until no deadlock state is found; however, the main drawback of this method is that it does not take into account the future deadlock state and requires many interactions with a developer. In this regard, it suffers from low efficiency. In this paper, the authors model multiple web service interaction with a Petri net called Composition net (C-net). The protocol-level mismatch problem is transformed into the empty siphon problem of a C-net. The authors take future deadlock states into consideration through this model, while finding the optimal solution that involves fewest interactions with a developer. The proposed method is proved to achieve higher efficiency for resolving protocol-level mismatch issues than traditional ones.
Article Preview


In web service composition, when multiple web services are developed by different groups or vendors, they often fail to invoke each other because of mismatches. Service composition mismatches can be divided into interface and protocol-level ones (Nezhad, 2007). Table 1 gives a detailed taxonomy of already known service composition mismatches.

Table 1.
Taxonomy of service composition mismatches
Service composition mismatchesInterface mismatchesmessage signature mismatches
message split/merge mismatches
message missing/extra mismatches
Protocol level mismatchesunspecified reception
mutual waiting mismatches
non-local choice mismatches

Complete Article List

Search this Journal:
Volume 19: 4 Issues (2022): Forthcoming, Available for Pre-Order
Volume 18: 4 Issues (2021)
Volume 17: 4 Issues (2020)
Volume 16: 4 Issues (2019)
Volume 15: 4 Issues (2018)
Volume 14: 4 Issues (2017)
Volume 13: 4 Issues (2016)
Volume 12: 4 Issues (2015)
Volume 11: 4 Issues (2014)
Volume 10: 4 Issues (2013)
Volume 9: 4 Issues (2012)
Volume 8: 4 Issues (2011)
Volume 7: 4 Issues (2010)
Volume 6: 4 Issues (2009)
Volume 5: 4 Issues (2008)
Volume 4: 4 Issues (2007)
Volume 3: 4 Issues (2006)
Volume 2: 4 Issues (2005)
Volume 1: 4 Issues (2004)
View Complete Journal Contents Listing