Equivalence checking is a formal verification approach that consists in proving that two
programs or models are related modulo some equivalence relation, or that one is included …

In contrast to the usual understanding of probabilistic systems as stochastic processes,
recently these systems have also been regarded as transformers of probabilities. In this …

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 …

One of the prevailing ideas in applied concurrency theory and verification is the concept of
automata minimization with respect to strong or weak bisimilarity. The minimal automata can …

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 …

Probabilistic automata (PA) are a prominent compositional concurrency model. As a way to
justify property-preserving abstractions, in the last years, bisimulation relations over …

In concurrency theory, weak bisimilarity is often used to relate processes exhibiting the same
observable behaviour. The probabilistic environment gives rise to several generalisations; …

We propose a probabilistic transition system specification format, referred to as probabilistic
RBB safe, for which rooted branching bisimulation is a congruence. The congruence …

A substantial amount of today's engineering problems revolve around systems that are
concurrent and stochastic by their nature. Solution approaches attacking these problems …

Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm
that needs to check a polynomial number of linear programming problems encoding weak …