On Decomposition of Stochastic Finite-State Systems

Abstract

Various decomposition models for stochastic finite-state systems (stochastic automata with or without output) are discussed. A new type of information flow - the next state from an interconnection-component instead of the present state - is introduced in well known loop-free and feed-back decomposition models. Results on these modified decomposition models are stated (like necessary and sufficient conditions for a system to be decomposed) are stated, and the difference between these and the corresponding results on the classical models are discussed with respect to f. ex. don't care transitions and synthesis.