Distribution bisimilarity via the power of convex algebras
zbMATH Open1480.18005arXiv1707.02344MaRDI QIDQ5155671FDOQ5155671
Authors: Filippo Bonchi, Alexandra Silva, Ana Sokolova 
Publication date: 8 October 2021
Full work available at URL: https://arxiv.org/abs/1707.02344
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Logics of knowledge and belief (including belief change) (03B42) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Universal coalgebra: A theory of systems
- On the semantics of Markov automata
- Checking NFA equivalence with bisimulations up to congruence
- Relating coalgebraic notions of bisimulation
- Bisimulation can't be traced
- Title not available (Why is that?)
- Bialgebras for structural operational semantics: an introduction
- Bisimulation through probabilistic testing
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Title not available (Why is that?)
- Probabilistic systems coalgebraically: a survey
- Automatic verification of real-time systems with discrete probability distributions.
- Congruences of convex algebras.
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Concurrency and composition in a stochastic world
- Distributing probability over non-determinism
- Power structures
- Trace semantics via determinization
- Coinduction up-to in a fibrational setting
- Enhancements of the bisimulation proof method
- Convexity, duality and effects
- Title not available (Why is that?)
- Title not available (Why is that?)
- States of convex sets
- Title not available (Why is that?)
- Eilenberg--Moore algebras for stochastic relations
- Exploring probabilistic bisimulations. I
- Testing Finitary Probabilistic Processes
- Characterising Testing Preorders for Finite Probabilistic Processes
- EQUIVALENCE OF LABELED MARKOV CHAINS
- Title not available (Why is that?)
- A hierarchy of probabilistic system types
- Erratum and addendum: ``Eilenberg-Moore algebras for stochastic relations
- Approximate verification of the symbolic dynamics of Markov chains
- Probabilistic Bisimulation: Naturally on Distributions
- Generalizing the powerset construction, coalgebraically
- Formal verification of timed properties of randomized distributed algorithms
- A Convenient Category for Higher-Order Probability Theory
- Title not available (Why is that?)
- Postulates for the barycentric calculus
- Title not available (Why is that?)
- Introduction to coalgebra. Towards mathematics of states and observation
- Termination in convex sets of distributions
- Upper-expectation bisimilarity and Łukasiewicz \(\mu \)-calculus
- Environmental bisimulations for probabilistic higher-order languages
- Commutative semantics for probabilistic programming
- A spectrum of behavioral relations over LTSs on probability distributions
- Compositional abstraction techniques for probabilistic automata
- Limit synchronization in Markov decision processes
- Some results on complex algebras of subalgebras
- Robustly parameterised higher-order probabilistic models
Cited In (5)
Uses Software
This page was built for publication: Distribution bisimilarity via the power of convex algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155671)
