Abstract
Compensating CSP (cCSP) extends CSP for specification and verification of long running transactions. The original cCSP is a modest extension to a subset of CSP that does not consider non-deterministic choice, synchronized composition, and recursion. There are a few further extensions. However, it remains a challenge to develop a fixed-point theory of process refinement in cCSP. This paper provides a complete solution to this problem and develops a theory of cCSP, corresponding to the theory of CSP, so that the verification techniques and their tools, such as FDR, can be extended for compensating processes. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Chen, Z., Liu, Z., & Wang, J. (2011). Failure-divergence refinement of compensating communicating processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6664 LNCS, pp. 262–277). https://doi.org/10.1007/978-3-642-21437-0_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
