Compensating CSP (cCSP) is an extension to CSP for modeling longrunning transactions. It can be used to specify the programs written in orchestration languages, such as WSBPEL. cCSP has only an operational semantics and a trace semantics that are not expressive enough for reasoning about deadlock and divergence. We extend cCSP with more operators and define for it a failuredivergence semantics. The significant algebraic laws are presented for the new operators with respect to the new semantics for its justification as well as for understanding. In addition, a case study is given to demonstrate the extended cCSP.