Distribution bisimilarity via the power of convex algebras
From MaRDI portal
Publication:5155671
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 1064116 (Why is no real title available?)
- scientific article; zbMATH DE number 1497870 (Why is no real title available?)
- scientific article; zbMATH DE number 1753205 (Why is no real title available?)
- scientific article; zbMATH DE number 2169341 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- scientific article; zbMATH DE number 3428045 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A Convenient Category for Higher-Order Probability Theory
- A hierarchy of probabilistic system types
- A spectrum of behavioral relations over LTSs on probability distributions
- Approximate verification of the symbolic dynamics of Markov chains
- Automatic verification of real-time systems with discrete probability distributions.
- Bialgebras for structural operational semantics: an introduction
- Bisimulation can't be traced
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation through probabilistic testing
- Characterising Testing Preorders for Finite Probabilistic Processes
- Checking NFA equivalence with bisimulations up to congruence
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Coinduction up-to in a fibrational setting
- Commutative semantics for probabilistic programming
- Compositional abstraction techniques for probabilistic automata
- Concurrency and composition in a stochastic world
- Congruences of convex algebras.
- Convexity, duality and effects
- Distributing probability over non-determinism
- EQUIVALENCE OF LABELED MARKOV CHAINS
- Eilenberg--Moore algebras for stochastic relations
- Enhancements of the bisimulation proof method
- Environmental bisimulations for probabilistic higher-order languages
- Erratum and addendum: ``Eilenberg-Moore algebras for stochastic relations
- Exploring probabilistic bisimulations. I
- Formal verification of timed properties of randomized distributed algorithms
- Generalizing the powerset construction, coalgebraically
- Introduction to coalgebra. Towards mathematics of states and observation
- Limit synchronization in Markov decision processes
- On the semantics of Markov automata
- Postulates for the barycentric calculus
- Power structures
- Probabilistic Bisimulation: Naturally on Distributions
- Probabilistic systems coalgebraically: a survey
- Relating coalgebraic notions of bisimulation
- Robustly parameterised higher-order probabilistic models
- Some results on complex algebras of subalgebras
- States of convex sets
- Termination in convex sets of distributions
- Testing Finitary Probabilistic Processes
- Trace semantics via determinization
- Universal coalgebra: A theory of systems
- Upper-expectation bisimilarity and Łukasiewicz \(\mu \)-calculus
Cited in
(5)
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)
