20 citations · 53 across the 9 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2015★ 4 cited
Distribution-based Bisimulation and Bisimulation Metric in Probabilistic Automata
Yuan Feng, Lei Song, Lijun Zhang
Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the ot…
cs.FL2012★ 19 cited
Late Weak Bisimulation for Markov Automata
Christian Eisentraut, Jens Chr. Godskesen, Holger Hermanns +2
Weak bisimilarity is a distribution-based equivalence notion for Markov automata. It has gained some popularity as the coarsest reasonable behavioural equivalence on Markov automat…