Reliability of Cermet Cladding Parts Based on the Failure Tree Series

Based on failure mode analysis of the cermet cladding part, the last layer failure assumption is adopted and the method to establish reliability model of the cladding part based on the failure tree series is proposed. Theoretical and example investigations are carried out. The failure tree series for the failure process of the cermet cladding part under the mechanical impact are established.

DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA

Weighted multioperator tree automata (for short: wmta) are finite-state bottom-up tree automata in which the transitions are weighted with an operation taken from some multioperator monoid. A wmta recognizes a tree series which is a mapping from the set of trees to some commutative monoid. We prove that every wmta recognizable tree series can be decomposed into a relabeling tree transformation, a recognizable tree language, and a tree series computed by a homomorphism wmta; vice versa, the composition of an arbitrary relabeling tree transformation, a recognizable tree language, and a tree series computed by a homomorphism wmta yields a wmta recognizable tree series. We use this characterization result for specific multioperator monoids and prove (1) a new decomposition of polynomial bottom-up tree series transducers over semirings and (2) a new characterization of tree series which are recognizable by weighted tree automata over semirings, in terms of projections of local tree languages.