Specifying and Model Checking Distributed Control Algorithms at Meta-level. (22nd September 2021)

• Record Type: Journal Article
• Authors: Doan, Ha Thi Thu; Ogata, Kazuhiro
• Is Part Of: Computer journal. Volume 65:Number 12(2022)
• Page Start: 2998
• Page End: 3019
• Publication Date: 2021-09-22
• Subjects: distributed algorithms -- control algorithms -- meta-programming -- formal specification -- model checking; Computers -- Periodicals; 005.1
• DOI: 10.1093/comjnl/bxab122
• Languages: English
• ISSNs: 0010-4620

Abstract

Abstract: This paper proposes an approach to the specification and model checking of a large, important class of distributed algorithms called control algorithms (CAs), which are superimposed on underlying distributed systems (UDSs). The approach is based on rewriting logic by moving from its object level to the meta-level. We introduce the idea of specifying CAs as meta-programs that take the specifications of UDSs and automatically generate the specifications of the UDSs on which the CAs are superimposed (UDS-CAs). Due to many options, such as network topologies, even fixing the number of each kind of entities, such as mobile support stations (MSSs) and mobile hosts (MHs) in a mobile checkpointing algorithm, there are many instances of a UDS. To address the problem, we generate all possible initial states of a UDS for a fixed number of each kind of entities such that some constraints, such as MSSs strongly connected with a wired network, are fulfilled and conduct model checking for each of the initial states. We demonstrate the usefulness by reporting on a case study where a counterexample is found for some specific initial states but not for the other initial states, detecting a subtle flaw lurking in a mobile checkpointing algorithm.