scientific article; zbMATH DE number 7407782
zbMath1480.18005arXiv1707.02344MaRDI QIDQ5155671
Filippo Bonchi, Ana Sokolova, Alexandra Silva
Publication date: 8 October 2021
Full work available at URL: https://arxiv.org/abs/1707.02344
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logics of knowledge and belief (including belief change) (03B42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bialgebras for structural operational semantics: an introduction
- Probabilistic systems coalgebraically: a survey
- A hierarchy of probabilistic system types
- Eilenberg--Moore algebras for stochastic relations
- Erratum and addendum: ``Eilenberg-Moore algebras for stochastic relations
- Bisimulation through probabilistic testing
- Universal coalgebra: A theory of systems
- Automatic verification of real-time systems with discrete probability distributions.
- Power structures
- Exploring probabilistic bisimulations. I
- On the semantics of Markov automata
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Congruences of convex algebras.
- Trace semantics via determinization
- Postulates for the barycentric calculus
- Environmental bisimulations for probabilistic higher-order languages
- Introduction to Coalgebra
- Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
- Compositional Abstraction Techniques for Probabilistic Automata
- Checking NFA equivalence with bisimulations up to congruence
- States of Convex Sets
- Approximate Verification of the Symbolic Dynamics of Markov Chains
- Commutative Semantics for Probabilistic Programming
- Relating coalgebraic notions of bisimulation
- A Spectrum of Behavioral Relations over LTSs on Probability Distributions
- Convexity, Duality and Effects
- Testing Finitary Probabilistic Processes
- Probabilistic Bisimulation: Naturally on Distributions
- EQUIVALENCE OF LABELED MARKOV CHAINS
- Concurrency and Composition in a Stochastic World
- Characterising Testing Preorders for Finite Probabilistic Processes
- Bisimulation can't be traced
- Termination in Convex Sets of Distributions
- Robustly Parameterised Higher-Order Probabilistic Models
- Coinduction up-to in a fibrational setting
- A Convenient Category for Higher-Order Probability Theory
- Formal verification of timed properties of randomized distributed algorithms
- Limit Synchronization in Markov Decision Processes
- Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
- Enhancements of the bisimulation proof method
- Distributing probability over non-determinism
This page was built for publication:
