Formalizing cCSP Synchronous Semantics in PVS

TL;DR

This paper extends the formal semantics of compensating CSP (cCSP) to include synchronization, and mechanically verifies the semantic relationship using the PVS theorem prover, enhancing proof scalability.

Contribution

It introduces synchronization into cCSP semantics and demonstrates mechanical verification of semantic relationships in PVS, improving formal analysis methods.

Findings

Synchronization successfully integrated into cCSP semantics.

Semantic relationship verified using PVS theorem prover.

Enhanced scalability of proof techniques achieved.

Abstract

Compensating CSP (cCSP) is a language defined to model long running business transactions within the framework of standard CSP process algebra. In earlier work, we have defined both traces and operational semantics of the language. We have shown the consistency between the two semantic models by defining a relationship between them. Synchronization was missing from the earlier semantic definitions which is an important feature for any process algebra. In this paper, we address this issue by extending the syntax and semantics to support synchronization and define a relationship between the semantic models. Moreover, we improve the scalability of our proof technique by mechanically verifying the semantic relationship using theorem prover PVS. We show how to embed process algebra terms and semantics into PVS and to use these embeddings to prove the semantic relationship.