In this paper we focus on bisimulation for weighted
automata [1]}. Weighted automata were introduced by
Shützenburger [2]} and have found renewed
interest in the last two decades [3]} as they arise in
various contexts where quantitative modelling is involved. Intuitively, weighted
automata generalize the notion of nondeterministic automata where each
transition has an associated weight valued in some semiring. Such a weight could
represent a cost, reward or probability, or any other measure of interest. Like
nondeterministic automata, the behaviour of weighted automata have two different
characterizations, in terms of weighted language equivalence and weighted
bisimulation.
