A decomposition theorem for probabilistic transition systems
From MaRDI portal
Publication:673117
Recommendations
Cites Work
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 3269042 (Why is no real title available?)
- scientific article; zbMATH DE number 3307591 (Why is no real title available?)
- scientific article; zbMATH DE number 3310090 (Why is no real title available?)
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
Cited In (11)
- A decomposition theorem for finite persistent transition systems
- Parametric probabilistic transition systems for system design and analysis
- Title not available (Why is no real title available?)
- Categorical foundations for randomly timed automata
- On Almost-Sure Properties of Probabilistic Discrete Event Systems
- Effective theories for circuits and automata
- Title not available (Why is no real title available?)
- Equivalences for silent transitions in probabilistic systems (extended abstract)
- Synthesizing Probabilistic Invariants via Doob’s Decomposition
- On coverings of products of uninitialized sequential quantum machines
- Title not available (Why is no real title available?)
This page was built for publication: A decomposition theorem for probabilistic transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673117)