NEARLY-COMPLETELY DECOMPOSABLE STOCHASTIC PROCESSESLOUCHARD G; LATOUCHE G.1981; APPLIED SYSTEMS AND CYBERNETICS. INTERNATIONAL CONGRESS ON APPLIED SYSTEMS RESEARCH AND CYBERNETICS/1980/ACAPULCO; USA/GBR/FRA; NEW YORK; OXFORD; PARIS: PERGAMON PRESS; DA. 1981; PP. 2701-2704; BIBL. 3 REF.Conference Paper

RANDOM TIMES IN NEARLY-COMPLETELY DECOMPOSABLE, TRANSIENT MARKOV CHAINSLOUCHARD G; LATOUCHE G.1982; CAH. CENT. ETUD. RECH. OPER.; ISSN 0008-9737; BEL; DA. 1982; VOL. 24; NO 2-4; PP. 321-352; BIBL. 19 REF.Article

Stochastic automata networks and near complete decomposabilityGUSAK, Oleg; DAYAR, Tugrul; FOURNEAU, Jean-Michel et al.SIAM journal on matrix analysis and applications. 2002, Vol 23, Num 2, pp 581-599, issn 0895-4798Article

Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reorderingPEKERGIN, Nihal; DAYAR, Tugrul; ALPARSLAN, Denizhan N et al.European journal of operational research. 2005, Vol 165, Num 3, pp 810-825, issn 0377-2217, 16 p.Article