35 citations · 169 across the 13 of their papers we have counts for
Showing 2016 · cs.FLShow all
2 papers · 2 filters
cs.FL2016
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One
Stefan Göller, Christoph Haase, Ranko Lazić +1
Branching VASS (BVASS) generalise vector addition systems with states by allowing for special branching transitions that can non-deterministically distribute a counter value betwee…
cs.FL2016
Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images
Christoph Haase, Stefan Kiefer, Markus Lohrey
A cost Markov chain is a Markov chain whose transitions are labelled with non-negative integer costs. A fundamental problem on this model, with applications in the verification of…