CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Using schedulers to test probabilistic distributed systems
Authors
B Sarikaya
C Morgan
+27 more
C Morgan
C Morgan
C Morgan
GJ Myers
H Ural
K Larsen
L Cacciari
L Cheung
M Bravetti
M Núñez
Manuel Núñez
N López
NA Lynch
O Rafiq
P Ammann
R Cleaveland
R Glabbeek van
R Segala
R Segala
RM Hierons
RM Hierons
RM Hierons
RM Hierons
Robert M. Hierons
S-H Wu
SC Boyd
W Grieskamp
Publication date
29 June 2012
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
Abstract
This is the author's accepted manuscript. The final publication is available at Springer via http://dx.doi.org/10.1007/s00165-012-0244-5. Copyright © 2012, British Computer Society.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
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Sustaining member
Brunel University Research Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:bura.brunel.ac.uk:2438/881...
Last time updated on 19/09/2014
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2Fs00165-012-...
Last time updated on 11/12/2019