• Feb 07, 2023 News!JACN will adopt Article-by-Article Work Flow. The benefit of article-by-article workflow is that a delay with one article may not delay the entire issue. Once a paper steps into production, it will be published online soon.   [Click]
  • May 30, 2022 News!JACN Vol.10, No.1 has been published with online version.   [Click]
  • Dec 24, 2021 News!Volume 9 No 1 has been indexed by EI (inspec)!   [Click]
General Information
    • ISSN: 1793-8244 (Print)
    • Abbreviated Title:  J. Adv. Comput. Netw.
    • Frequency: Semiyearly
    • DOI: 10.18178/JACN
    • Editor-in-Chief: Professor Haklin Kimm
    • Executive Editor: Ms. Cherry Chan
    • Abstracting/ Indexing: EBSCO, ProQuest, and Google Scholar.
    • E-mail: jacn@ejournal.net
    • APC: 500USD
Professor Haklin Kimm
East Stroudsburg University, USA
I'm happy to take on the position of editor in chief of JACN. We encourage authors to submit papers on all aspects of computer networks.

JACN 2016 Vol.4(4): 193-200 ISSN: 1793-8244
DOI: 10.18178/JACN.2016.4.4.230

Verification of Service Composition and Compensation by Using Process Algebra

S. Ripon, F. Sultana, and F. Rahman

Abstract—Web service technology provides a platform that facilitates the development of distributed services. In order to support business to business interactions within the distributed environment a crying need is to aggregate web services and assemble them is a goal oriented infrastructure. With the emergence of web services, the coordination and interaction involved between multiple business partners are conducted by using the web services. Faults can arise at any stage of business transaction and handling such faults where multiple partners are involved is both crucial and difficult. Process algebras can be used to model concurrent and distributed interactive systems. Compensating CSP is a language defined to model business transactions within the framework of CSP process algebra. It has the facility to model faults within a transaction as compensations. However, the language lacks automated tool support to verify the service composition. Finite state Process (FSP), on the other hand, is designed to model the composition of web services and importantly, it has an automated tool support for verification of composition of services, however there is no construct for compensation. By combining the benefits the both cCSP and FSP, this paper illustrates a mechanism to model and verify the composition of services and compensation in FSP by following the mechanism adopted in cCSP. The verification of composition properties is performed by LTSA tool.

Index Terms—Compensation, web services, cCSP, FSP.

S. Ripon, F. Sultana, and F. Rahman are with the Department of Computer Science and Engineering, East West University, Bangladesh (e-mail: dshr@ewubd.edu).


Cite:S. Ripon, F. Sultana, and F. Rahman, "Verification of Service Composition and Compensation by Using Process Algebra," Journal of Advances in Computer Networks vol. 4, no. 4, pp. 193-200, 2016.

Copyright © 2008-2024. Journal of Advances in Computer Networks.  All rights reserved.
E-mail: jacn@ejournal.net