An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems

From MaRDI portal
Publication:520240

DOI10.1007/S00165-016-0405-ZzbMATH Open1358.68078arXiv1609.08531OpenAlexW2189367575WikidataQ59615030 ScholiaQ59615030MaRDI QIDQ520240FDOQ520240

Andrey Mokhov, A. Bhattacharyya, Ken Pierce

Publication date: 3 April 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Abstract: This paper uses a case study to evaluate empirically three formalisms of different kinds for their suitability for the modelling and analysis of dynamic reconfiguration of dependable systems. The requirements on an ideal formalism for dynamic software reconfiguration are defined. The reconfiguration of an office workflow for order processing is described, and the requirements on the reconfiguration of the workflow are defined. The workflow is modelled using the Vienna Development Method (mathrmVDM), conditional partial order graphs (mathrmCPOGs), and the basic Calculus of Communicating Systems for dynamic process reconfiguration (basic mathrmCCSdp), and verification of the reconfiguration requirements is attempted using the models. The formalisms are evaluated according to their ability to model the reconfiguration of the workflow, to verify the requirements on the workflow's reconfiguration, and to meet the requirements on an ideal formalism.


Full work available at URL: https://arxiv.org/abs/1609.08531




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520240)