Please use this identifier to cite or link to this item:
Title: Using schedulers to test probabilistic distributed systems
Authors: Hierons, RM
Núñez, M
Keywords: Distributed systems;Formal testing;Probabilistic systems;Schedulers
Issue Date: 2012
Publisher: Springer
Citation: Formal Aspects of Computing, 24(4), 679 - 699, 2012
Abstract: Formal methods are one of the most important approaches to increasing the confidence in the correctness of software systems. A formal specification can be used as an oracle in testing since one can determine whether an observed behaviour is allowed by the specification. This is an important feature of formal testing: behaviours of the system observed in testing are compared with the specification and ideally this comparison is automated. In this paper we study a formal testing framework to deal with systems that interact with their environment at physically distributed interfaces, called ports, and where choices between different possibilities are probabilistically quantified. Building on previous work, we introduce two families of schedulers to resolve nondeterministic choices among different actions of the system. The first type of schedulers, which we call global schedulers, resolves nondeterministic choices by representing the environment as a single global scheduler. The second type, which we call localised schedulers, models the environment as a set of schedulers with there being one scheduler for each port. We formally define the application of schedulers to systems and provide and study different implementation relations in this setting.
Description: This is the author's accepted manuscript. The final publication is available at Springer via Copyright © 2012, British Computer Society.
ISSN: 0934-5043
Appears in Collections:Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf283.81 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.