Action systems is a formalism designed for the construction of parallel and distributed systems in a stepwise manner within the refinement calculus. In this paper we show how action systems can be derived and refined within a mechanical proof tool, the B-Tool. We describe how action systems are embedded in B-Tool. Due to this embedding we can now develop parallel and distributed systems within the B-Tool. We also show how a typical and nontrivial refinement rule, the superposition refinement rule, is formalized and applied on action systems within B-Tool. A derivation towards a distributed load balancing algorithm is given as a case study.
|Title of host publication||Proceedings of Formal Methods Europe (FME'96)|
|Subtitle of host publication||Symposium on Industrial Benefit and Advances in Formal Methods|
|Place of Publication||Oxford, England|
|Publication status||Published - 1996|
|MoE publication type||A4 Article in a conference publication|
|Name||Lecture Notes in Computer Science|