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.