Sciweavers

22 search results - page 1 / 5
» Executable Semantics for Compensating CSP
Sort
View
EPEW
2005
Springer
13 years 9 months ago
Executable Semantics for Compensating CSP
Compensation is an error recovery mechanism for long-running transactions. Compensating CSP is a variant of the CSP process algebra with constructs for orchestration of compensatio...
Michael J. Butler, Shamim Ripon
MEMOCODE
2003
IEEE
13 years 9 months ago
Bridging CSP and C++ with Selective Formalism and Executable Specifications
CSP (Communicating Sequential Processes) is a useful algebraic notation for creating a hierarchical behavioural specification for concurrent systems, due to its formal interproces...
William B. Gardner
BIRTHDAY
2004
Springer
13 years 9 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira
COORDINATION
2004
Springer
13 years 9 months ago
An Operational Semantics for StAC, a Language for Modelling Long-Running Business Transactions
This paper presents the StAC language and its operational semantics. StAC (Structured Activity Compensation) is a business process modelling language and a distinctive feature of t...
Michael J. Butler, Carla Ferreira
BIRTHDAY
2004
Springer
13 years 9 months ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes