Compositional probabilistic model checking with string diagrams of MDPs
From MaRDI portal
Recommendations
Cites work
- A compositional approach to parity games
- A functor-valued invariant of tangles
- A Representation Theorem for Unique Decomposition Categories
- Abstraction-Refinement for Hierarchical Probabilistic Models
- Categories for Quantum Theory
- Categories for the working mathematician.
- Compositional higher-order model checking via -regular games over Böhm trees
- Compositional probabilistic model checking with string diagrams of MDPs
- Compositional probabilistic verification through multi-objective model checking
- scientific article; zbMATH DE number 4180789 (Why is no real title available?)
- scientific article; zbMATH DE number 4123722 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Maximizing the conditional expected reward for reaching the goal
- Notions of computation and monads
- Open system categorical quantum semantics in natural language processing
- Parameter synthesis for Markov models: faster than ever
- Traced monoidal categories
Cited in
(6)- Compositional probabilistic model checking with string diagrams of MDPs
- A compositional framework for Petri nets
- Causally deterministic Markov decision processes
- Categorical semantics of compositional reinforcement learning
- Compositional verification of almost-sure Büchi objectives in MDPs
- Pareto fronts for compositionally solving string diagrams of parity games
This page was built for publication: Compositional probabilistic model checking with string diagrams of MDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535679)