We propose decision algorithms for bisimulation relations defined on probabilistic automata, a model for concurrent nondeterministic systems with randomization. The algorithms decide both strong and weak bisimulation relations based on deterministic as well as randomized schedulers. These algorithms extend and complete other known algorithms for simpler relations and models. The algorithm we pr...

We study coupled logical bisimulation (CLB) to reason about contextual equivalence in the λcalculus. CLB originates in a work by Dal Lago, Sangiorgi and Alberti, as a tool to reason about a λ-calculus with probabilistic constructs. We adapt the original definition to the pure λ-calculus. We develop the metatheory of CLB in call-by-name and in call-by-value, and draw comparisons with applicative...

This paper studies context bisimulation for higher-order processes, in the presence of parameterization (viz. abstraction). We show that the extension of higher-order processes with process parameterization retains the characterization of context bisimulation by a much simpler form of bisimulation called normal bisimulation (viz. they are coincident), in which universal quantifiers are eliminat...