A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
PVS Embedding of cCSP Semantic Models and Their Relationship
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
This paper demonstrates an embedding of the semantic models of the cCSP process algebra in the general purpose theorem prover PVS. cCSP is a language designed to model long-running business transactions with constructs for orchestration of compensations. The cCSP process algebra terms are defined in PVS by using mutually recursive datatype. The trace and the operational semantics of the algebra are embedded in PVS. We show how these semantic embeddings are used to define and prove a
doi:10.1016/j.entcs.2009.08.020
fatcat:l6klx2exevgzhdf6ulsgyhsgjm