Open AccessOn Decomposition of Stochastic Finite-State Systems
Author(s) -
Mogens Nielsen
Publication year - 1973
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v2i8.6423
Subject(s) - decomposition , automaton , state (computer science) , type (biology) , component (thermodynamics) , mathematics , flow (mathematics) , finite state machine , computer science , mathematical optimization , theoretical computer science , algorithm , physics , ecology , biology , thermodynamics , geometry
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.