Probabilistic diagnostics with P-graphs

Polgár Balázs and Selényi Endre: Probabilistic diagnostics with P-graphs. In: Acta cybernetica, (16) 2. pp. 279-291. (2003)

[thumbnail of cybernetica_016_numb_002_279-291.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_016_numb_002_279-291.pdf

Download (1MB) | Preview

Abstract

This paper presents a novel approach for solving the probabilistic diagnosis problem in multiprocessor systems. The main idea of the algorithm is based on the reformulation of the diagnostic procedure as a P-graph model. The same, well-elaborated mathematical paradigm - originally used to model material flow - can be applied in our approach to model information flow. This idea is illustrated by deriving a maximum likelihood diagnostic decision procedure. The diagnostic accuracy of the solution is considered on the basis of simulation measurements, and a method of constructing a general framework for different aspects of a complex problem is demonstrated with the use of P-graph models.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2003
Volume: 16
Number: 2
ISSN: 0324-721X
Page Range: pp. 279-291
Language: English
Place of Publication: Szeged
Event Title: Conference for PhD Students in Computer Science (3.) (2002) (Szeged)
Related URLs: http://acta.bibl.u-szeged.hu/38516/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 290-291. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 15. 08:15
URI: http://acta.bibl.u-szeged.hu/id/eprint/12723

Actions (login required)

View Item View Item