5 citations · 12 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LO2021
Linear-Time Model Checking Branching Processes
Stefan Kiefer, Pavel Semukhin, Cas Widdershoven
(Multi-type) branching processes are a natural and well-studied model for generating random infinite trees. Branching processes feature both nondeterministic and probabilistic bran…
cs.FL2021★ 1 cited
Decision Questions for Probabilistic Automata on Small Alphabets
Paul C. Bell, Pavel Semukhin
We study the emptiness and -reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degr…