A decomposition theorem for probabilistic transition systems

DOI10.1016/0304-3975(95)00004-GzbMATH Open0873.68145MaRDI QIDQ673117FDOQ673117

Authors: Oded Maler 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

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

zbMATH Keywords

probabilistic transition systemsdeterministic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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?)
• 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 that?)
• 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 that?)
• 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 that?)

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)