scientific article; zbMATH DE number 7566077
From MaRDI portal
Publication:5094151
Filippo Bonchi, Ana Sokolova, Valeria Vignudelli
Publication date: 2 August 2022
Full work available at URL: https://arxiv.org/abs/1808.00923
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
coalgebranondeterminismprobabilistic automatatrace semanticsdeterminisationconvex subsets of distributions monadsemantics for probability
Related Items (2)
Towards general axiomatizations for bisimilarity and trace semantics ⋮ Algebraic presentation of semifree monads
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planning and acting in partially observable stochastic domains
- Semantic domains for combining probability and non-determinism
- A general account of coinduction up-to
- 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
- Testing equivalences for processes
- Universal coalgebra: A theory of systems
- Layer by layer -- combining monads
- Convex language semantics for nondeterministic probabilistic automata
- Distribution-based bisimulation for labelled Markov processes
- Convexity theories. IV: Klein-Hilbert parts in convex modules
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Trace semantics via determinization
- Postulates for the barycentric calculus
- Introduction to Coalgebra
- Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
- Checking NFA equivalence with bisimulations up to congruence
- Coalgebraic trace semantics via forgetful logics
- Relating coalgebraic notions of bisimulation
- Convexity, Duality and Effects
- Testing Finitary Probabilistic Processes
- Probabilistic Bisimulation: Naturally on Distributions
- Complete Lattices and Up-To Techniques
- On the bisimulation proof method
- Termination in Convex Sets of Distributions
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- A Convenient Category for Higher-Order Probability Theory
- Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
- Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
- Enhancements of the bisimulation proof method
- Generic Trace Semantics via Coinduction
- Distributing probability over non-determinism
- Probabilistic automata
- Derivatives of Regular Expressions
This page was built for publication:
