Axiomatizations for probabilistic bisimulation
From MaRDI portal
Recommendations
- Probabilistic weak bisimulation and axiomatization for probabilistic models
- Bisimulation and cocongruence for probabilistic systems
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
- Probabilistic bisimulation
- Probabilistic bisimulation as a congruence
- Equational axioms for probabilistic bisimilarity
- Branching bisimulation congruence for probabilistic systems
- Branching bisimulation congruence for probabilistic systems
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Bisimulation for probabilistic transition systems: A coalgebraic approach
Cited in
(51)- Hiding resources that can fail: An axiomatic perspective
- Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Exploring probabilistic bisimulations. I
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Complete axiomatization for the total variation distance of Markov chains
- A complete axiomatization of weighted branching bisimulation
- Towards general axiomatizations for bisimilarity and trace semantics
- Weak bisimulation is sound and complete for pCTL\(^*\)
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Probabilistic temporal logics via the modal mu-calculus
- An efficient algorithm to determine probabilistic bisimulation
- Environmental bisimulations for probabilistic higher-order languages
- Remarks on testing probabilistic processes
- Notes on generative probabilistic bisimulation
- Probabilistic barbed congruence
- Probabilistic bisimulation as a congruence
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Equational axioms for probabilistic bisimilarity
- scientific article; zbMATH DE number 2186294 (Why is no real title available?)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours
- Probabilistic Bisimulation: Naturally on Distributions
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- scientific article; zbMATH DE number 1497781 (Why is no real title available?)
- Norm functions for probabilistic bisimulations with delays
- Weak bisimulation for probabilistic systems
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- Bisimulations, logics, and trace distributions for stochastic systems with rewards
- Two axiomatic approaches to the probabilistic serial mechanism
- Complete axiomatization for the bisimilarity distance on Markov chains
- Convexity via Weak Distributive Laws
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- A Complete Axiomatisation for Probabilistic Trace Equivalence
- Quantitative Kleene coalgebras
- Axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules
- Non Expansive ε-Bisimulations
- Foundations of Software Science and Computational Structures
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Sound approximate and asymptotic probabilistic bisimulations for PCTL
- Finite axiomatization for symbolic probabilistic -calculus
- A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice
- Uniform random process model revisited
- A cancellation law for probabilistic processes
- A completeness theorem for probabilistic regular expressions
- Branching bisimulation congruence for probabilistic systems
- Model independent approach to probabilistic models
- Axiomatizations for probabilistic finite-state behaviors
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- Making random choices invisible to the scheduler
This page was built for publication: Axiomatizations for probabilistic bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535031)
