The extension of long-running transactions compensation language-StAC

Author

Hao, Yonghong ; Zhong, Farong

Author_Institution

Dept. of Comput. Sci., Zhejiang Normal Univ., Jinhua, China

Volume

2

fYear

2011

Firstpage

713

Lastpage

717

Abstract

This paper investigates the StAC language (Structured Activity Compensation) which can be used to specify the orchestration of activities in long-running business transactions, based on the existing problems between compensation and termination in web services. First, we propose the extended StAC syntax, and then show two examples to illustrate the extended operators. Second, we present the operational semantics to ensure the compensation mechanism by labeled transition relations, making use of structural congruence relations, following a predicate of compensation updating.

Keywords

Web services; computational linguistics; formal specification; StAC syntax; Structured Activity Compensation language; Web service; compensation updating; labeled transition relation; long-running business transaction; long-running transactions compensation language; operational semantics; orchestration specification; structural congruence relation; Business; Calculus; Force; Games; Semantics; Syntactics; Web services; compensation; long-running transactions; operational semantics; structural congruence; termination; web services;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Network Technology (ICCSNT), 2011 International Conference on

Conference_Location

Harbin

Print_ISBN

978-1-4577-1586-0

Type

conf

DOI

10.1109/ICCSNT.2011.6182065

Filename

6182065