Formal Analysis of Services Compatibility

In this paper we propose an approach to check the compatibility of two services. The models of the services are built in Finite State Machine (FSM) and the behavior of services is described with the process of Communicating Sequential Processes (CSP). An operator named corresponding position concurrency is defined to facilitate the calculation of composability of the paths which are obtained from processes, thus we can determine whether the two services are compatible or not. Simple examples are introduced to illustrate how to use this approach.

[1]  Xiang Fu,et al.  Conversation specification: a new approach to design and analysis of e-service composition , 2003, WWW '03.

[2]  Fangfang Liu,et al.  Compatibility analysis of Web services , 2005, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05).

[3]  Gerhard Weikum,et al.  Social Wisdom for Search and Recommendation , 2008, IEEE Data Eng. Bull..

[4]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[5]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[6]  Yuliang Shi,et al.  Formal analysis of compatibility of Web services via CCS , 2005, International Conference on Next Generation Web Services Practices (NWeSP'05).

[7]  MengChu Zhou,et al.  Modeling Service Compatibility with Pi-calculus for Choreography , 2006, ER.

[8]  Boualem Benatallah,et al.  Web Service Protocols: Compatibility and Adaptation , 2008, IEEE Data Eng. Bull..

[9]  Massimo Mecella,et al.  When are Two Web Services Compatible? , 2004, TES.

[10]  Diego Calvanese,et al.  Automatic Composition of E-services That Export Their Behavior , 2003, ICSOC.

[11]  Daniel M. Yellin,et al.  Protocol specifications and component adaptors , 1997, TOPL.