Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/15420
Title: | Constraint-based oracles for timed distributed systems |
Authors: | Benharrat, N Gaston, C Hierons, RM Lapitre, A Le Gall, P |
Issue Date: | 2017 |
Citation: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, 10533 LNCS pp. 276 - 292 |
Abstract: | © 2017, IFIP International Federation for Information Processing. 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. |
URI: | http://bura.brunel.ac.uk/handle/2438/15420 |
DOI: | http://dx.doi.org/10.1007/978-3-319-67549-7_17 |
ISBN: | 9783319675480 |
ISSN: | 0302-9743 1611-3349 |
Appears in Collections: | Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 471.79 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.