5 citations · 8 across the 2 of their papers we have counts for
5 papers
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…
Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs
Paul C. Bell, Pavel Semukhin
We show the surprising result that the cutpoint isolation problem is decidable for Probabilistic Finite Automata (PFA) where input words are taken from a letter-bounded context-fre…
On the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond
Paul C. Bell, Igor Potapov, Pavel Semukhin
We consider the following variant of the Mortality Problem: given matrices , does there exist nonnegative integers such tha…
On Reachability Problems for Low-Dimensional Matrix Semigroups
Thomas Colcombet, Joël Ouaknine, Pavel Semukhin +1
We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for…
Decidability of the Membership Problem for integer matrices
Igor Potapov, Pavel Semukhin
The main result of this paper is the decidability of the membership problem for nonsingular integer matrices. Namely, we will construct the first algorithm that for any…