Reasoning about Action Systems using the B-Method

  • Authors:
  • M. Waldén;K. Sere

  • Affiliations:
  • Turku Centre of Computer Science (TUCS), bo Akademi University, Department of Computer Science, FIN-20520 Turku, Finland.;Turku Centre of Computer Science (TUCS), bo Akademi University, Department of Computer Science, FIN-20520 Turku, Finland.

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

The action system formalism has been succesfully used whenconstructing parallel and distributed systems in a stepwise mannerwithin the refinement calculus. Usually the derivation is carried outmanually. In order to be able to produce more trustworthy software,some mechanical tool is needed. In this paper we show how actionsystems can be derived and refined within the B-Toolkit, which is amechanical tool supporting a software development method, theB-Method. We describe how action systems are embedded in theB-Method. Furthermore, we show how a typical and nontrivialrefinement rule, the superposition refinement rule, is formalized andapplied on action systems within the B-Method. In addition toproviding tool support for action system refinement we also extendthe application area of the B-Method to cover parallel anddistributed systems. A derivation towards a distributed loadbalancing algorithm is given as a case study.