Skip to Main content Skip to Navigation

Model-Based Testing of Timed Distributed Systems : A Constraint-Based Approach for Solving the Oracle Problem

Abstract : Model-based testing of reactive systems is the process of checking if a System Under Test (SUT) conforms to its model. It consists of handling both test data generation and verdict computation by using models. We specify the behaviour of reactive systems using Timed Input Output Symbolic Transition Systems (TIOSTS) that are timed automata enriched with symbolic mechanisms to handle data. When TIOSTSs are used to test systems with a centralized interface, the user may completely order events occurring at this interface (i.e., inputs sent to the system and outputs produced from it). Interactions between the tester and the SUT are sequences of inputs and outputs named traces, separated by delays in the timed framework, to form so-called timed traces. Distributed systems are collections of communicating local components which interact with their environment at physically distributed interfaces. Interacting with such a distributed system requires exchanging values with it by means of several interfaces in the same testing process. Different events occurring at different interfaces cannot be ordered any more. This thesis focuses on conformance testing for distributed systems where a separate tester is placed at each localized interface and may only observe what happens at this interface. We assume that there is no global clock but only local clocks for each localized interface. The semantics of such systems can be seen as tuples of timed traces. We consider a framework for distributed testing from TIOSTS along with corresponding test hypotheses and a distributed conformance relation called dtioco. Global conformance can be tested in a distributed testing architecture using only local testers without any communication between them. We propose an algorithm to check communication policy for a tuple of timed traces by formulating the verification of message passing in terms of Constraint Satisfaction Problem (CSP). Hence, we were able to implement the computation of test verdicts by orchestrating both localised off-line testing algorithms and the verification of constraints defined by message passing that can be supported by a constraint solver. Lastly, we validated our approach on a real case study of a telecommunications distributed system.
Document type :
Complete list of metadatas

Cited literature [95 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Friday, September 20, 2019 - 1:53:08 PM
Last modification on : Thursday, October 8, 2020 - 3:21:37 AM
Long-term archiving on: : Sunday, February 9, 2020 - 4:30:35 AM


Version validated by the jury (STAR)


  • HAL Id : tel-02292973, version 1



Nassim Benharrat. Model-Based Testing of Timed Distributed Systems : A Constraint-Based Approach for Solving the Oracle Problem. Other. Université Paris Saclay (COmUE), 2018. English. ⟨NNT : 2018SACLC021⟩. ⟨tel-02292973⟩



Record views


Files downloads