Model independent approach to probabilistic models
From MaRDI portal
Publication:831149
DOI10.1016/j.tcs.2021.04.001zbMath1497.68338OpenAlexW3149394920MaRDI QIDQ831149
Publication date: 10 May 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.001
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Cites Work
- Polynomial time decision algorithms for probabilistic automata
- Confluence reduction for Markov automata
- Probabilistic systems coalgebraically: a survey
- Non-deterministic exponential time has two-prover interactive protocols
- Branching bisimulation congruence for probabilistic systems
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- Axiomatizations for probabilistic finite-state behaviors
- Theory of interaction
- On the power of multi-prover interactive protocols
- Testing equivalences for processes
- Branching bisimilarity is an equivalence indeed!
- Reactive, generative, and stratified models of probabilistic processes
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Probabilistic divide \& congruence: branching bisimilarity
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Pseudorandomness
- Proof verification and the hardness of approximation problems
- Probabilistic Bisimulation: Naturally on Distributions
- The knowledge complexity of interactive proof-systems
- Three logics for branching bisimulation
- Branching time and abstraction in bisimulation semantics
- Compositional weak metrics for group key update
- Probability and Nondeterminism in Operational Models of Concurrency
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
