Constraint-based oracles for timed distributed systems

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

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 Ci has its own local tester that interacts with Ci and this local tester observes a local trace consisting of inputs, outputs and durations as perceived by Ci. An observation made in testing is thus a multi-trace: a tuple of (timed) local traces, one for each Ci. 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.

Cite

CITATION STYLE

APA

Benharrat, N., Gaston, C., Hierons, R. M., Lapitre, A., & Le Gall, P. (2017). Constraint-based oracles for timed distributed systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10533 LNCS, pp. 276–292). Springer Verlag. https://doi.org/10.1007/978-3-319-67549-7_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free