Formal analysis of services compatibility

Xueqiang Gong, Jing Liu*, Miaomiao Zhang, Jueliang Hu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2009 33rd Annual IEEE International Computer Software and Applications Conference, COMPSAC 2009
Pages243-248
Number of pages6
DOIs
StatePublished - 2009
Event2009 33rd Annual IEEE International Computer Software and Applications Conference, COMPSAC 2009 - Seattle, WA, United States
Duration: 20 Jul 200924 Jul 2009

Publication series

NameProceedings - International Computer Software and Applications Conference
Volume2
ISSN (Print)0730-3157

Conference

Conference2009 33rd Annual IEEE International Computer Software and Applications Conference, COMPSAC 2009
Country/TerritoryUnited States
CitySeattle, WA
Period20/07/0924/07/09

Fingerprint

Dive into the research topics of 'Formal analysis of services compatibility'. Together they form a unique fingerprint.

Cite this