# Constraint-Based Oracles for Timed Distributed Systems

Abstract : This paper studies the situation in which the system under test and the system model are distributed and have the same structure; they have corresponding remote components that communicate asynchronously. In testing, a component with interface $C_i$ has its own local tester that interacts with $C_i$ and this local tester observes a local trace consisting of inputs, outputs and durations as perceived by $C_i$. An observation made in testing is thus a multi-trace: a tuple of (timed) local traces, one for each $C_i$. The conformance relation for such distributed systems combines a classical unitary conformance relation for localised components and the requirement that the communication policy was satisfied. By expressing the communication policy as a constraint satisfaction problem, we were able to implement the computation of test verdicts by orchestrating localised off-line testing algorithms and the verification of constraints defined by message passing between components. Lastly, we illustrate our approach on a telecommunications system.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [20 references]

https://hal.inria.fr/hal-01678964
Contributor : Hal Ifip <>
Submitted on : Tuesday, January 9, 2018 - 3:40:06 PM
Last modification on : Saturday, May 1, 2021 - 3:49:37 AM

### File

449632_1_En_17_Chapter.pdf
Files produced by the author(s)

### Citation

Nassim Benharrat, Christophe Gaston, Robert Hierons, Arnault Lapitre, Pascale Gall. Constraint-Based Oracles for Timed Distributed Systems. 29th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2017, St. Petersburg, Russia. pp.276-292, ⟨10.1007/978-3-319-67549-7_17⟩. ⟨hal-01678964⟩

Record views