Labelled Markov processes.
From MaRDI portal
Recommendations
Cited in
(73)- Approximating labelled Markov processes
- When are stochastic transition systems tameable?
- SOS specifications for uniformly continuous operators
- From probability monads to commutative effectuses
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- A probabilistic calculus of cyber-physical systems
- Bisimulation metrics and norms for real-weighted automata
- Automated verification and synthesis of stochastic hybrid systems: a survey
- On \(\mathbf{MV} \)-coalgebras over the category of BL-algebras
- Stick breaking, in coalgebra and probability
- Continuous-variable nonlocality and contextuality
- Bisimulation for Feller-Dynkin processes
- Towards a classification of behavioural equivalences in continuous-time Markov processes
- Hennessy-Milner results for probabilistic PDL
- A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
- Structural operational semantics for continuous state stochastic transition systems
- Precisely deciding CSL formulas through approximate model checking for CTMCs
- Expressiveness of probabilistic modal logics: a gradual approach
- Probabilistic NetKAT
- A theory of slicing for probabilistic control flow graphs
- A metrized duality theorem for Markov processes
- Labelled Markov processes as generalised stochastic relations
- A theory for the semantics of stochastic and non-deterministic continuous systems
- Model-based verification, optimization, synthesis and performance evaluation of real-time systems
- ``Keep definition, change category -- a practical approach to state-based system calculi
- Modular Markovian Logic
- Limits in categories of Vietoris coalgebras
- Statistical Model Checking for Networks of Priced Timed Automata
- The expectation monad in quantum foundations
- Algebraic properties of stochastic effectivity functions
- Measurable stochastics for Brane calculus
- scientific article; zbMATH DE number 1361128 (Why is no real title available?)
- Ontological models for quantum theory as functors
- Bisimulation as a logical relation
- Congruences for stochastic automata
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- An algebraic theory of Markov processes
- A stochastic interpretation of game logic
- Probabilistic logics based on Riesz spaces
- A channel-based perspective on conjugate priors
- Disintegration and Bayesian inversion via string diagrams
- Foundations of Software Science and Computation Structures
- Stochastic Relations
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Free energy of Petri nets
- Bisimulation for Markov decision processes through families of functional expressions
- Random Measurable Selections
- Affine Monads and Side-Effect-Freeness
- Measure transformer semantics for Bayesian machine learning
- Approximating Markov processes by averaging
- Conditional expectation and the approximation of labelled Markov processes.
- Coalgebraic tools for randomness-conserving protocols
- Metrics for labelled Markov processes
- Beyond Bell's theorem. II: Scenarios with arbitrary causal structure
- Reversible monadic computing
- An effect-theoretic account of Lebesgue integration
- A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces
- Behavioural equivalences for continuous-time Markov processes
- A principled approach to expectation maximisation and latent Dirichlet allocation using Jeffrey's update rule
- Stone duality for relations
- (Towards a) statistical probabilistic lazy lambda calculus
- Probability monads with submonads of deterministic states
- Joint distributions in probabilistic semantics
- Propositional logics for the Lawvere quantale
- Overdrawing urns using categories of signed probabilities
- A classification of bisimilarities for general Markov decision processes
- A definition scheme for quantitative bisimulation
- Quantitative monoidal algebra: axiomatising distance with string diagrams
- Double glueing over free exponential: with measure theoretic applications
- Generic weakest precondition semantics from monads enriched with order
- Behavioural equivalences for coalgebras with unobservable moves
This page was built for publication: Labelled Markov processes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3619416)
