Bisimulation for probabilistic transition systems: A coalgebraic approach

DOI10.1016/S0304-3975(99)00035-3zbMath0930.68092MaRDI QIDQ1960528

E. P. de Vink, Jan J. M. M. Rutten

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

coalgebrasbisimulationfinal coalgebraBorel measuresprobabilistic transition systemsultrametric spaces

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (58)

Coalgebras for fuzzy transition systems ⋮ Approximating Labelled Markov Processes Again! ⋮ Relating Coalgebraic Notions of Bisimulation ⋮ Identifying all preorders on the subdistribution monad ⋮ Behavioural differential equations: a coinductive calculus of streams, automata, and power series ⋮ Iterated covariant powerset is not a monad ⋮ Recursively defined metric spaces without contraction ⋮ Bisimulation as a logical relation ⋮ Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence ⋮ A Demonic Approach to Information in Probabilistic Systems ⋮ Structural Operational Semantics for Weighted Transition Systems ⋮ Metrics for labelled Markov processes ⋮ Testing probabilistic equivalence through reinforcement learning ⋮ Structural operational semantics for stochastic and weighted transition systems ⋮ Reduction semantics in Markovian process algebra ⋮ A Formalized Hierarchy of Probabilistic System Types ⋮ Expressiveness of probabilistic modal logics: a gradual approach ⋮ Bisimulations of Probabilistic Boolean Networks ⋮ Approximating labelled Markov processes ⋮ Modalities in the Stone age: a comparison of coalgebraic logics ⋮ Measurable stochastics for Brane calculus ⋮ Bialgebras for structural operational semantics: an introduction ⋮ Approximating Markov processes through filtration ⋮ Idempotent probability measures on ultrametric spaces ⋮ Constructive logical characterizations of bisimilarity for reactive probabilistic systems ⋮ Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra ⋮ Modular construction of complete coalgebraic logics ⋮ Approximate relational Hoare logic for continuous random samplings ⋮ Monoid-labeled transition systems ⋮ A logical duality for underspecified probabilistic systems ⋮ Bisimulation relations for weighted automata ⋮ Bisimulation on Markov Processes over Arbitrary Measurable Spaces ⋮ Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes ⋮ Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice ⋮ Linear Structures for Concurrency in Probabilistic Programming Languages ⋮ Fuzzy Prokhorov metric on the set of probability measures ⋮ A hierarchy of probabilistic system types ⋮ A compositional approach to defining logics for coalgebras ⋮ Domain theory, testing and simulation for labelled Markov processes ⋮ A behavioural pseudometric for probabilistic transition systems ⋮ An introduction to metric semantics: Operational and denotational models for programming and specification languages ⋮ On the final sequence of a finitary set functor ⋮ Measuring the confinement of probabilistic systems ⋮ Metrization of free groups on ultrametric spaces ⋮ A modular approach to defining and characterising notions of simulation ⋮ Bisimulation and cocongruence for probabilistic systems ⋮ Approximating and computing behavioural distances in probabilistic transition systems ⋮ Bisimulation for labelled Markov processes ⋮ Unnamed Item ⋮ Terminal Sequence Induction via Games ⋮ Approximating Markov Processes by Averaging ⋮ Termination in Convex Sets of Distributions ⋮ GSOS for probabilistic transition systems ⋮ Coalgebraic logic ⋮ Universal coalgebra: A theory of systems ⋮ Unnamed Item ⋮ A theory of stochastic systems. I: Stochastic automata ⋮ Structural operational semantics for continuous state stochastic transition systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domain theory and integration
• Probabilistic communicating processes
• Solving reflexive domain equations in a category of complete metric spaces
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Topological dualities in semantics
• Coalgebraic logic
• Additions and corrections to ``Terminal coalgebras in well-founded set theory
• A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems
• Universal coalgebra: A theory of systems
• Reactive, generative, and stratified models of probabilistic processes
• Dynamical systems, measures, and fractals via domain theory
• Bisimulation from open maps
• Descriptive set theory and harmonic analysis
• Formal verification of parallel programs
• Hybrid automata with finite bisimulations
• An approach to object semantics based on terminal co-algebras
• A final coalgebra theorem
• Extended Markovian Process Algebra

This page was built for publication: Bisimulation for probabilistic transition systems: A coalgebraic approach