English

Semipullbacks of labelled Markov processes

Probability 2023-06-22 v4 Logic in Computer Science

Abstract

A labelled Markov process (LMP) consists of a measurable space SS together with an indexed family of Markov kernels from SS to itself. This structure has been used to model probabilistic computations in Computer Science, and one of the main problems in the area is to define and decide whether two LMP SS and SS' "behave the same". There are two natural categorical definitions of sameness of behavior: SS and SS' are bisimilar if there exist an LMP T T and measure preserving maps forming a diagram of the shape STS S\leftarrow T \rightarrow{S'}; and they are behaviorally equivalent if there exist some U U and maps forming a dual diagram SUS S\rightarrow U \leftarrow{S'}. These two notions differ for general measurable spaces but Doberkat (extending a result by Edalat) proved that they coincide for analytic Borel spaces, showing that from every diagram SUSS\rightarrow U \leftarrow{S'} one can obtain a bisimilarity diagram as above. Moreover, the resulting square of measure preserving maps is commutative (a semipullback). In this paper, we extend the previous result to measurable spaces SS isomorphic to a universally measurable subset of a Polish space with the trace of the Borel σ\sigma-algebra, using a version of Strassen's theorem on common extensions of finitely additive measures.

Keywords

Cite

@article{arxiv.1706.02801,
  title  = {Semipullbacks of labelled Markov processes},
  author = {Jan Pachl and Pedro Sánchez Terraf},
  journal= {arXiv preprint arXiv:1706.02801},
  year   = {2023}
}
R2 v1 2026-06-22T20:13:35.680Z