Compositional probabilistic model checking with string diagrams of MDPs
From MaRDI portal
Publication:6535679
DOI10.1007/978-3-031-37709-9_3zbMATH Open1547.68458MaRDI QIDQ6535679
Kazuyuki Asada, Kazuki Watanabe, Ichiro Hasuo, Clovis Eberhart
Publication date: 1 February 2024
Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60) String diagrams and graphical calculi (18M30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compositional probabilistic verification through multi-objective model checking
- A functor-valued invariant of tangles
- Notions of computation and monads
- Parameter synthesis for Markov models: faster than ever
- A Representation Theorem for Unique Decomposition Categories
- Maximizing the Conditional Expected Reward for Reaching the Goal
- Compositional higher-order model checking via ω -regular games over Böhm trees
- Traced monoidal categories
- Categories for Quantum Theory
- Open System Categorical Quantum Semantics in Natural Language Processing
- Abstraction-Refinement for Hierarchical Probabilistic Models
- Compositional probabilistic model checking with string diagrams of MDPs
- A compositional approach to parity games
Related Items (2)
Compositional probabilistic model checking with string diagrams of MDPs ⋮ A compositional framework for Petri nets
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)
