Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages

Labeled state-to-function transition systems, FuTS for short, admit multiple transition schemes from states to functions of finite support over general semirings. As such they constitute a convenient modeling instrument to deal with stochastic process languages. In this paper, the notion of bisimulation induced by a FuTS is proposed and a correspondence result is proven stating that FuTS-bisimulation coincides with the behavioral equivalence of the associated functor. As generic examples, the concrete existing equivalences for the core of the process algebras ACP, PEPA and IMC are related to the bisimulation of specific FuTS, providing via the correspondence result coalgebraic justification of the equivalences of these calculi.

💡 Research Summary

The paper introduces Labeled State‑to‑Function Transition Systems (FuTS) as a unifying formalism for modeling stochastic process languages. A FuTS consists of a set of states, a set of labels, and a transition function that maps a state‑label pair to a finitely supported function over a chosen semiring. By allowing arbitrary semirings (e.g., Boolean, non‑negative reals, probability distributions) the framework can simultaneously capture nondeterminism, rates, probabilities, and costs within a single transition structure.

The authors define FuTS‑bisimulation: two states are bisimilar if, for every label, the resulting transition functions are related pointwise by a relation that respects the semiring operations (addition, scalar multiplication). This relation is shown to be a congruence for the transition functions, guaranteeing closure under the algebraic operations inherent in the semiring.

The central theoretical contribution is a correspondence theorem stating that FuTS‑bisimulation coincides exactly with the behavioral equivalence of the functor F that maps a set X to the set of all label‑indexed, finitely supported functions X → R (for a given semiring R). The proof proceeds by constructing the coalgebraic category of F‑coalgebras, demonstrating that the bisimulation relation satisfies the standard coalgebraic bisimulation conditions, and then proving the converse: any behavioral equivalence in the coalgebraic sense yields a FuTS‑bisimulation. Key technical lemmas involve preservation of limits and colimits by F, and the compatibility of the semiring operations with the functorial structure.

To illustrate the general result, the paper instantiates FuTS for three well‑known process algebras: the core of ACP, PEPA, and IMC. For ACP, a Boolean semiring reproduces the classic strong bisimulation. For PEPA, the semiring of non‑negative reals encodes rates, and the induced FuTS‑bisimulation matches the standard PEPA strong equivalence based on rate aggregation. For IMC, a composite semiring combining probabilities and real‑valued rates models both probabilistic and Markovian transitions; the resulting FuTS‑bisimulation aligns with the mixed bisimulation defined for IMC.

These case studies demonstrate that existing equivalences are not ad‑hoc artifacts but are instances of a single coalgebraic notion. Consequently, FuTS provides a modular, mathematically robust foundation for defining and reasoning about behavioral equivalences across a wide spectrum of stochastic process languages. The paper concludes by suggesting that future language designers can adopt FuTS as a core semantic layer, gaining immediate access to coalgebraic tools for verification, minimization, and tool integration.