A hierarchy of scheduler classes for stochastic automata

DOI10.1007/978-3-319-89366-2_21zbMath1504.68142arXiv1710.05763OpenAlexW2767054264MaRDI QIDQ1653000

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

Publication date: 17 July 2018

Full work available at URL: https://arxiv.org/abs/1710.05763

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe-construction

This page was built for publication: A hierarchy of scheduler classes for stochastic automata