A Hierarchy of Scheduler Classes for Stochastic Automata

Pedro R. D'Argenio, Marcus Gerhold, Arnd Hartmanns, Sean Sedwards

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    5 Citations (Scopus)
    86 Downloads (Pure)


    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. unbounded probabilistic reachability. We find that, unlike Markovian formalisms, stochastic automata distinguish most classes even in this basic setting. Verification and strategy synthesis methods thus face a tradeoff between powerful and efficient classes. Using lightweight scheduler sampling, we explore this tradeoff and demonstrate the concept of a useful approximative verification technique for stochastic automata.
    Original languageEnglish
    Title of host publicationProceedings of the 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2018)
    EditorsChristel Baier, Ugo Dal Lago
    Place of PublicationCham
    Number of pages19
    ISBN (Electronic)978-3-319-89366-2
    ISBN (Print)978-0-319-89365-5
    Publication statusPublished - 1 Jan 2018

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Dive into the research topics of 'A Hierarchy of Scheduler Classes for Stochastic Automata'. Together they form a unique fingerprint.

    Cite this