Butler, M.J. (1993) Refinement and decomposition of value-passing action systems in the refinement calculus. In, Best, E. and Best, E. (eds.) CONCUR'93. (Lecture Notes in Computer Science, , (doi:10.1007/3-540-57208-2_16), 715) 4th Intrenational Conference on Concurrency Theory (22/08/93 - 26/08/93) Berlin, Heidelberg. Springer. (doi:10.1007/3-540-57208-2_16).
Abstract
The action system formalism [3] is a state-based approach to distributed computing. In this paper, it is shown how the action system formalism may be used to describe systems that interact with their environment through synchronised value-passing. Definitions and rules are presented for refining and decomposing such action systems into distributed implementations in which internal communication is also based on synchronised value-passing. Specification and refinement is similar to the refinement calculus approach [1, 10, 12]. The theoretical basis for communication and distribution is Hoare's CSP [6]. Use of the refinement and decomposition rules is illustrated by the design of an unordered buffer.
Full text not available from this repository.
More information
Identifiers
Catalogue record
Export record
Altmetrics
Contributors
University divisions
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.