Please use this identifier to cite or link to this item:
|Title:||Implementation relations and probabilistic schedulers in the distributed test architecture|
|Keywords:||model-based testing;probabilistic systems;distributed systems|
|Citation:||Hierons, R.M. and Núñez, M. (2017) 'Implementation relations and probabilistic schedulers in the distributed test architecture', Journal of Systems and Software, 132, pp. 319-335. doi: 10.1016/j.jss.2017.03.011.|
|Abstract:||We present a complete framework to formally test systems with distributed ports where some choices are probabilistically quantified while other choices are non-deterministic. We define different implementation relations, that is, relations that state what it means for a system to be a valid implementation of a specification. We also study how these relate. In order to define these implementation relations we use probabilistic schedulers, a more powerful version, including probabilistic choices, of a notion of scheduler introduced in our previous work. Probabilistic schedulers, when applied to either a specification or an implementation, resolve all the possible non-determinism, so that we can compare purely probabilistic systems.|
|Appears in Collections:||Dept of Computer Science Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.