Refinement and decomposition of value-passing action systems in the refinement calculus
Refinement and decomposition of value-passing action systems in the refinement calculus
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.
Butler, M.J.
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Best, E.
4a9c347a-68b3-4ee3-b0c3-929b82be96ed
1993
Butler, M.J.
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Best, E.
4a9c347a-68b3-4ee3-b0c3-929b82be96ed
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, 715)
4th Intrenational Conference on Concurrency Theory (22/08/93 - 26/08/93)
Berlin, Heidelberg.
Springer.
(doi:10.1007/3-540-57208-2_16).
Record type:
Book Section
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.
This record has no associated files available for download.
More information
Published date: 1993
Venue - Dates:
4th Intrenational Conference on Concurrency Theory, , Hildesheim, Germany, 1993-08-22 - 1993-08-26
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 250968
URI: http://eprints.soton.ac.uk/id/eprint/250968
PURE UUID: d03f35dc-c167-48a0-8ff5-e38a35fa5b29
Catalogue record
Date deposited: 07 Oct 1999
Last modified: 13 Dec 2021 02:40
Export record
Altmetrics
Contributors
Author:
M.J. Butler
Editor:
E. Best
Editor:
E. Best
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.
View more statistics