Failure-Divergence Refinement of Compensating Communicating Processes
نویسندگان
چکیده
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.
منابع مشابه
Failure-divergence semantics and refinement of long running transactions
Compensating CSP (cCSP) models long-running transactions. It can be used tospecify service orchestrations written in programming languages like WS-BPEL.However, the original cCSP does not allow to model internal (non-deterministic)choice, synchronized parallel composition, hiding or recursion. In this paper, weintroduce these operators and define for the extended language a fail...
متن کاملLinking Theories of Concurrency
We construct a Galois connection between the theories that underlie CCS [7] and CSP [4]. It projects the complete transition system for CCS onto exactly the subset that satisfies the healthiness conditions of CSP. The construction applies to several varieties of both calculi: CCS with strong, weak or barbed simulation, and CSP with trace refinement or failures refinement, or failures/divergence...
متن کاملA Process Algebraic Approach to Decomposition of Communicating SysML Blocks
The block concept is a fundamental modelling construct in the Systems Modeling Language (SysML), a visual modelling language for systems engineering applications. In a top-down systems engineering approach, an abstract block is decomposed into concrete communicating sub-blocks. However, the classifier behaviour of the abstract block must be exhibited by the composition of the concrete sub-block...
متن کاملAngelic processes
In the formal modelling of systems, demonic and angelic nondeterminism play fundamental roles as abstraction mechanisms. The angelic nature of a choice pertains to the property of avoiding failure whenever possible. As a concept, angelic choice first appeared in automata theory and Turing machines, where it can be implemented via backtracking. It has traditionally been studied in the refinement...
متن کاملGeneral dynamic recovery for compensating CSP
Compensation is a technique to roll-back a system to a consistent state in case of failure. Recovery mechanisms for compensating calculi specify the order of execution of compensation sequences. Dynamic recovery means that the order of execution is determined at runtime. In this paper, we define an extension of Compensating CSP, called DEcCSP, with general dynamic recovery. We provide a formal,...
متن کامل