A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Hierarchy of Scheduler Classes for Stochastic Automata
[chapter]
2018
Lecture Notes in Computer Science
Stochastic automata are a formal compositional model for concurrent stochastic timed systems, with general distributions and nondeterministic choices. Measures of interest are defined over schedulers that resolve the nondeterminism. In this paper we investigate the power of various theoretically and practically motivated classes of schedulers, considering the classic complete-information view and a restriction to non-prophetic schedulers. We prove a hierarchy of scheduler classes w.r.t.
doi:10.1007/978-3-319-89366-2_21
fatcat:n5vypaav6fcmvp4lldb7zxdnqe