Testing Distributed Systems Through Symbolic Model Checking

Kalyon, Gabriel; Massart, Thierry; Meuter, Cédric; Begin, Laurent Van

doi:10.1007/978-3-540-73196-2_17

Cited by 3 publications

(1 citation statement)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A lot of related works, consider an offline approach where the execution, given as a Mazurkiewicz trace [28] is provided from the beginning (see e.g. [12], [19] for a review and efficient methods). Online global predicate detection has been studied, e.g.…”

Section: Introductionmentioning

confidence: 99%

Symbolic Supervisory Control of Distributed Systems With Communications

Kalyon

Gall

Marchand

et al. 2014

IEEE Trans. Automat. Contr.

Self Cite

View full text Add to dashboard Cite

Abstract-We consider the control of distributed systems composed of subsystems communicating asynchronously; the aim is to build local controllers that restrict the behavior of a distributed system in order to satisfy a global state avoidance property. We model distributed systems as communicating finite state machines with reliable unbounded FIFO queues between subsystems. Local controllers can only observe the behavior of their proper subsystem and do not see the queue contents. To refine their control policy, controllers can use the FIFO queues to communicate by piggy-backing extra information (some timestamps and their state estimates) to the messages sent by the subsystems. We provide an algorithm that computes, for each local subsystem (and thus for each controller), during the execution of the system, an estimate of the current global state of the distributed system. We then define a synthesis algorithm to compute local controllers. Our method relies on the computation of (co-)reachable states. Since the reachability problem is undecidable in our model, we use abstract interpretation techniques to obtain overapproximations of (co-)reachable states. An implementation of our algorithms provides an empirical evaluation of our method.

show abstract

Section: Introductionmentioning

confidence: 99%

Symbolic Supervisory Control of Distributed Systems With Communications

Kalyon

Gall

Marchand

et al. 2014

IEEE Trans. Automat. Contr.

Self Cite

View full text Add to dashboard Cite

show abstract

Testing Distributed Systems Through Symbolic Model Checking

Kalyon

Massart

Meuter

et al. 2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The observation of a distributed system's finite execution can be abstracted as a partial ordered set of events generally called finite (partial order) trace. In practice, this trace can be obtained through a standard code instrumentation, which takes advantage of existing communications between processes to partially order events of different processes. We show that testing that such a distributed execution satisfies some global property amounts therefore to model check the corresponding trace. This work can be time consuming; we therefore provide an efficient symbolic Ctl model-checking algorithm for traces. This method is based on a symbolic data structure, called Interval Sharing Trees, allowing to efficiently represent and manipulate sets of k-uples of naturals. Efficient symbolic operations are defined on this data structure in order to deal with all Ctl modalities. We show that in practice this data structure is well adapted for Ctl model checking of traces.

show abstract