32 citations · 61 across the 17 of their papers we have counts for
Showing 2012 · cs.FLShow all
2 papers · 2 filters
cs.FL2012★ 3 cited
Bisimilarity of Pushdown Systems is Nonelementary
Michael Benedikt, Stefan Göller, Stefan Kiefer +1
Given two pushdown systems, the bisimilarity problem asks whether they are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, i…
cs.FL2012★ 1 cited
On the Complexity of the Equivalence Problem for Probabilistic Automata
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine +2
Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic sy…