The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Coordinated Decentralized Protocols for Failure Diagnosisof Discrete Event Systems
Discrete Event Dynamic Systems
A Calculus to Define Correct Tranformations of LOTOS Specifications
FORTE '91 Proceedings of the IFIP TC6/WG6.1 Fourth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, IV
The Power of QDDs (Extended Abstract)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
On implementation of global concurrent systems with local asynchronous controllers
CONCUR 2005 - Concurrency Theory
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Distributed state estimation in discrete event systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Global state estimates for distributed systems
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Verification of communication protocols using abstract interpretation of FIFO queues
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Global state estimates for distributed systems
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
McScM: a general framework for the verification of communicating machines
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
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.