A decomposition theorem for probabilistic transition systems

DOI10.1016/0304-3975(95)00004-GzbMath0873.68145MaRDI QIDQ673117

Oded Maler

Publication date: 28 February 1997

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

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)

Related Items

Categorical foundations for randomly timed automata, Parametric probabilistic transition systems for system design and analysis, On coverings of products of uninitialized sequential quantum machines, Effective theories for circuits and automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines