Skip navigation
Skip navigation

A scalable jointree algorithm for diagnosability

Schumann, A.; Huang, Jinbo


Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in a discrete-event system is diagnosable iff its occurrence can always be deduced once sufficiently many subsequent observable events have occurred. A classical approach to diagnosability checking constructs a finite state machine known as a twin plant for the system, which has a critical path iff some fault event is...[Show more]

CollectionsANU Research Publications
Date published: 2008
Type: Conference paper
Source: Proceedings of The 23rd AAAI Conference on Artificial Intelligence (AAAI-08)


File Description SizeFormat Image
01_Schumann_A_scalable_jointree_algorithm_2008.pdf488.22 kBAdobe PDF    Request a copy
02_Schumann_A_scalable_jointree_algorithm_2008.pdf84.9 kBAdobe PDF    Request a copy
03_Schumann_A_scalable_jointree_algorithm_2008.pdf54.64 kBAdobe PDF    Request a copy
04_Schumann_A_scalable_jointree_algorithm_2008.pdf22.7 kBAdobe PDF    Request a copy
05_Schumann_A_scalable_jointree_algorithm_2008.pdf641.81 kBAdobe PDF    Request a copy
06_Schumann_A_scalable_jointree_algorithm_2008.pdf46.83 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator