Model independent approach to probabilistic models
type: Item
instance of: scholarly article
title: Model independent approach to probabilistic models
zbMATH Open document ID: 1497.68338
author: Yuxi Fu
published in: Theoretical Computer Science
publication date: 2021-05-10T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 7346945
zbMATH Keywords: probabilistic process
zbMATH Keywords: bisimulation
zbMATH Keywords: divergence
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.04.001
OpenAlex ID: W3149394920
cites work: Branching bisimulation congruence for probabilistic systems
cites work: Branching bisimulation for probabilistic systems: characteristics and decidability
cites work: Proof verification and the hardness of approximation problems
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: Branching bisimilarity is an equivalence indeed!
cites work: Axiomatizing probabilistic processes: ACP with generative probabilities
cites work: Q4535031
cites work: Verification on infinite structures.
cites work: Probabilistic divide \& congruence: branching bisimilarity
cites work: Raiders of the lost equivalence: probabilistic branching bisimilarity
cites work: Axiomatizations for probabilistic finite-state behaviors
cites work: Testing equivalences for processes
cites work: On the power of multi-prover interactive protocols
cites work: Theory of interaction
cites work: Reactive, generative, and stratified models of probabilistic processes
cites work: Branching time and abstraction in bisimulation semantics
cites work: The knowledge complexity of interactive proof-systems
cites work: Q3997501
cites work: Probabilistic Bisimulation: Naturally on Distributions
cites work: Compositional weak metrics for group key update
cites work: Q3992568
cites work: Three logics for branching bisimulation
cites work: Q3907077
cites work: Q4536612
cites work: Q3906427
cites work: Probability and Nondeterminism in Operational Models of Concurrency
cites work: Probabilistic systems coalgebraically: a survey
cites work: Polynomial time decision algorithms for probabilistic automata
cites work: Confluence reduction for Markov automata
cites work: Pseudorandomness
DOI: 10.1016/J.TCS.2021.04.001
description: scientific article; zbMATH DE number 7346945