Skip to Main content Skip to Navigation
Journal articles

Formal analysis of control and termination of distributed computation in weaker spaces

Abstract : The control and termination detection of a distributed computation involving large-scale distributed database is difficult in the presence of concurrency, random network delays, and varying reliability of computing nodes. The formal modeling and analysis of controllability as well as termination detection of such systems are required to design reliable and dependable systems involving distributed computations and distributed datasets. The modeling and analysis of distributed computation can be performed by using combinatorial topology by forming simplexes, which imposes a set of relatively rigid geometric structures. This article proposes the modeling and analysis of observable and controllable distributed computation in weaker topological spaces. The proposed model enhances structural flexibility in metrized monotone spaces. The metrizability of the space and convergence property of the computation are analyzed. Axiomatic termination detection and fault mode analysis are formulated. A distributed algorithm is designed to observe and to determine varying control states of computation. The article includes a detailed comparative analysis of a set of models in the domain.
Complete list of metadata

https://hal.inria.fr/hal-01808740
Contributor : Susmit Bagchi <>
Submitted on : Wednesday, June 6, 2018 - 9:11:14 AM
Last modification on : Wednesday, August 28, 2019 - 12:54:04 PM
Long-term archiving on: : Friday, September 7, 2018 - 12:38:13 PM

File

Cogent2018.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Susmit Bagchi. Formal analysis of control and termination of distributed computation in weaker spaces . Cogent Engineering , Cogent OA, 2018, 5 (1), pp.1 - 20. ⟨10.1080/23311916.2018.1475033⟩. ⟨hal-01808740⟩

Share

Metrics

Record views

137

Files downloads

307