611 citations · 855 across the 28 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2014★ 4 cited
Cost Preserving Bisimulations for Probabilistic Automata
Andrea Turrini, Holger Hermanns
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled…
cs.FL2012★ 6 cited
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
Holger Hermanns, Andrea Turrini
Deciding in an efficient way weak probabilistic bisimulation in the context of Probabilistic Automata is an open problem for about a decade. In this work we close this problem by p…