Probabilistic Programming With Coordination and Compensation
Failure is the typical phenomena of the execution of long-running transactions. To accommodate the randoM features of internet-based computing we extend the Guarded Command Language by addition of probabilistic choice and coordination combinators. This paper deals with rollback and compensation mechanisms of the language by providing a probabilistic model. We also discuss algebraic properties of the new combinators, and show the completeness of the algebraic system by show how to convert programs to normal forms.
Ji-Feng He
Shanghai Key Laboratory of Trustworthy Computing East China Normal University, China
国际会议
上海
英文
1-1
2009-07-08(万方平台首次上网日期,不代表论文的发表时间)