10 citations · 10 across the 2 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2024
A Quadratic Lower Bound for Simulation
Jan Friso Groote, Jan Martens
We show that deciding simulation equivalence and simulation preorder have quadratic lower bounds assuming that the Strong Exponential Time Hypothesis holds. This is in line with th…
cs.LO2023
Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
Jan Martens, Jan Friso Groote
We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal.…