7 citations · 21 across the 10 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020★ 1 cited
Reachability in Dynamical Systems with Rounding
Christel Baier, Florian Funke, Simon Jantsch +6
We consider reachability in dynamical systems with discrete linear updates, but with fixed digital precision, i.e., such that values of the system are rounded at each step. Given a…
cs.FL2020★ 5 cited
The Big-O Problem
Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski +1
Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant m…