Model Checking Stochastic Branching Processes

DOI10.1007/978-3-642-32589-2_26zbMath1365.68320arXiv1206.1317OpenAlexW2098435584MaRDI QIDQ2912726

Taolue Chen, Klaus Dräger, Stefan Kiefer

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Model-free reinforcement learning for branching Markov decision processes ⋮ Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The uniform measure of simple regular sets of infinite trees

This page was built for publication: Model Checking Stochastic Branching Processes