The University of Southampton
University of Southampton Institutional Repository

Extending and Relating Semantic Models of Compensating CSP

Ripon, Shamim (2008) Extending and Relating Semantic Models of Compensating CSP University of Southampton, Electronics and Computer Science, Doctoral Thesis .

Record type: Thesis (Doctoral)


Business transactions involve multiple partners coordinating and interacting with each other. These transactions have hierarchies of activities which need to be orchestrated. Usual database approaches (e.g.,checkpoint, rollback) are not applicable to handle faults in a long running transaction due to interaction with multiple partners. The compensation mechanism handles faults that can arise in a long running transaction. Based on the framework of Hoare's CSP process algebra, Butler et al introduced Compensating CSP (cCSP), a language to model long-running transactions. The language introduces a method to declare a transaction as a process and it has constructs for orchestration of compensation. Butler et al also defines a trace semantics for cCSP. In this thesis, the semantic models of compensating CSP are extended by defining an operational semantics, describing how the state of a program changes during its execution. The semantics is encoded into Prolog to animate the specification. The semantic models are further extended to define the synchronisation of processes. The notion of partial behaviour is defined to model the behaviour of deadlock that arises during process synchronisation. A correspondence relationship is then defined between the semantic models and proved by using structural induction. Proving the correspondence means that any of the presentation can be accepted as a primary definition of the meaning of the language and each definition can be used correctly at different times, and for different purposes. The semantic models and their relationships are mechanised by using the theorem prover PVS. The semantic models are embedded in PVS by using Shallow embedding. The relationships between semantic models are proved by mutual structural induction. The mechanisation overcomes the problems in hand proofs and improves the scalability of the approach.

PDF Thesis.pdf - Author's Original
Download (1MB)
Other Proof-Scripts.tar.gz - Other
Download (2MB)

More information

Submitted date: 20 August 2008
Organisations: University of Southampton, Electronics & Computer Science


Local EPrints ID: 266584
PURE UUID: ab3b055e-7f61-48b7-8544-33fe5ca19d7c

Catalogue record

Date deposited: 20 Aug 2008 13:09
Last modified: 18 Jul 2017 07:15

Export record


Author: Shamim Ripon

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.