scientific article; zbMATH DE number 512839

MaRDI QIDQ4281534zbMATH OpenFDO

Authors Oded Maler

Publication date 28 November 1994

zbMATH Keywords

decomposability of probabilistic systemsdeterministic automatafinite Markov chainnon-determinismprobabilistic transition systems

Mathematics Subject Classification ID

Transition functions, generators and resolvents (60J35) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• A decomposition theorem for probabilistic transition systems
• scientific article; zbMATH DE number 3988717
• scientific article; zbMATH DE number 1439861
• A decomposition theorem for finite persistent transition systems
• scientific article; zbMATH DE number 3570372

Cited in

(9)

• A decomposition theorem for finite persistent transition systems
• Frequency of decomposability among machines with a large number of states
• Equivalences for silent transitions in probabilistic systems (extended abstract)
• On Almost-Sure Properties of Probabilistic Discrete Event Systems
• scientific article; zbMATH DE number 3988717 (Why is no real title available?)
• scientific article; zbMATH DE number 3570372 (Why is no real title available?)
• scientific article; zbMATH DE number 1795912 (Why is no real title available?)
• Synthesizing Probabilistic Invariants via Doob’s Decomposition
• A decomposition theorem for probabilistic transition systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281534)