Skip to Main content Skip to Navigation
Conference papers

Global State Estimates for Distributed Systems

Abstract : We consider distributed systems modeled as communicating finite state machines with reliable unbounded FIFO channels. As an essential sub-routine for control, monitoring and diagnosis applications, we provide an algorithm that computes, during the execution of the system, an estimate of the current global state of the distributed system for each local subsystem. This algorithm does not change the behavior of the system; each subsystem only computes and records a symbolic representation of the state estimates, and piggybacks some extra information to the messages sent to the other subsystems in order to refine their estimates. Our algorithm relies on the computation of reachable states. Since the reachability problem is undecidable in our model, we use abstract interpretation techniques to obtain regular overapproximations of the possible FIFO channel contents, and hence of the possible current global states. An implementation of this algorithm provides an empirical evaluation of our method.
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Hervé Marchand Connect in order to contact the contributor
Submitted on : Wednesday, March 30, 2011 - 3:15:17 PM
Last modification on : Thursday, February 17, 2022 - 10:08:04 AM
Long-term archiving on: : Saturday, December 3, 2016 - 9:24:36 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Gabriel Kalyon, Tristan Le Gall, Hervé Marchand, Thierry Massart. Global State Estimates for Distributed Systems. 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE), Jun 2011, Reykjavik, Iceland. pp.198-212, ⟨10.1007/978-3-642-21461-5_13⟩. ⟨inria-00581259⟩



Record views


Files downloads