ON THE ABSTRACT PROPERTIES OF MARKOV GRAPHS FOR MAPS ON TREES

Purpose – The purpose of this paper is to introduce a method for modelling the multi-state repairable systems subject to stochastic degradation processes by using the coloured stochastic Petri nets (CSPN). The method is a compact and flexible Petri nets model for multi-state repairable systems and offers an alternative to the combinatory of Markov graphs. Design/methodology/approach – The method is grounded on specific theorems used to design an algorithm for systematic construction of multi-state repairable systems models, whatever is their size. Findings – Stop and constraint functions were derived from these theorems and allow to considering k-out-of-n structure systems and to identifying the minimal cut sets, useful to monitoring the states evolution of the system. Research limitations/implications – The properties of this model will be studied, and new investigations will help to demonstrate the feasibility of the approach in real world, and more complex structure will be considered. Practical implications – The simulation models based on CSPN can be used as a tool by maintenance decision makers, for prediction of the effectiveness of maintenance strategies. Originality/value – The proposed approach and model provide an efficient tool for advanced investigations on the development and implementation of maintenance policies and strategies in real life.

Download Full-text

A note on parallel sampling in Markov graphs

Computational Statistics ◽

10.1007/s00180-019-00880-4 ◽

2019 ◽

Vol 34 (3) ◽

pp. 1087-1107

Author(s):

Verena Bauer ◽

Karl Fürlinger ◽

Göran Kauermann

Keyword(s):

Markov Graphs ◽

Parallel Sampling

Download Full-text

Speech synthesis using stochastic Markov graphs

2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221) ◽

10.1109/icassp.2001.941043 ◽

2002 ◽

Cited By ~ 7

Author(s):

M. Eichner ◽

M. Wolff ◽

S. Ohnewald ◽

R. Hoffmann

Keyword(s):

Speech Synthesis ◽

Markov Graphs

Download Full-text

More on linear and metric tree maps

Opuscula Mathematica ◽

10.7494/opmath.2021.41.1.55 ◽

2021 ◽

Vol 41 (1) ◽

pp. 55-70

Author(s):

Sergiy Kozerenko

Keyword(s):

Metric Tree ◽

Linear Maps ◽

Markov Graphs ◽

Functional Digraph ◽

Vertex Sets

We consider linear and metric self-maps on vertex sets of finite combinatorial trees. Linear maps are maps which preserve intervals between pairs of vertices whereas metric maps are maps which do not increase distances between pairs of vertices. We obtain criteria for a given linear or a metric map to be a positive (negative) under some orientation of the edges in a tree, we characterize trees which admit maps with Markov graphs being paths and prove that the converse of any partial functional digraph is isomorphic to a Markov graph for some suitable map on a tree.

Download Full-text