K. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi  Home/Search
Context
Related
| brockport.edu/~klakshm...alarmbrief.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brockport.edu/~klakshm...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we consider systems that can be modeled as directed acyclic graphs such that nodes represent components and directed edges represent fault propagation between components. Some components can be equipped with alarms that ring when they detect faulty behavior. We study algorithms that attempt to minimize the number of alarms to be placed so that a fault at any single component can be detected and uniquely diagnosed. We first show that the minimization problem is NP-hard, even when... (Update)
Similar documents (at the sentence level):
65.1%: Alarm Placement in Systems with Fault Propagation - Lakshmanan, Rosenkrantz, Ravi (1998) (Correct)
Active bibliography (related documents): More All
0.3: Self-Diagnosis of Grid-Interconnected Systems, with Application.. - Chessa (1999) (Correct)
0.3: Safety-Directed System Monitoring Using Safety Cases - Papadopoulos (2000) (Correct)
0.1: Grid Coverage for Surveillance and Target Location in.. - Chakrabarty, Iyengar, .. (2002) (Correct)
Similar documents based on text: More All
0.2: Conference Program, HPCU 99 - Conference (1999) (Correct)
0.2: Simple Heuristics for Unit Disk Graphs - Marathe, Breu, III, Ravi.. (1995) (Correct)
0.2: Many birds with one stone: Multi-objective.. - Ravi, Marathe.. (1993) (Correct)
BibTeX entry: (Update)
@misc{ lakshmanan-algorithms,
author = "K. B. Lakshmanan and Daniel J. Rosenkrantz and S. S. Ravi",
title = "Algorithms for Alarm Placement in Systems with Fault Propagation",
url = "citeseer.ist.psu.edu/253522.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
154 Introduction to Algorithms (context) - Corman, Leiserson et al. - 1990 ACM
92 A compendium of NP optimization problems - Crescenzi, Kann - 1995
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
56 the connection assignment problem of diagnosable systems (context) - Preparata, Metze et al. - 1967
10 Computational complexity issues in operative diagnosis of gr.. (context) - Rao - 1993 DBLP
3 Graph theory models in fault diagnosis and fault tolerance (context) - Malek, Liu - 1979
3 An improved algorithm for diagnosis of system failures in th.. (context) - Shiozaki, Matsuyama et al. - 1985
2 Failure propagating simulation and nonfailure paths search i.. (context) - Kokawa, Shingai - 1982
2 Distinguishability criteria in oriented graphs and its appli.. (context) - Mayeda, Ramamoorthy - 1969
2 NPComplete diagnosis problems on system graphs (context) - Ibaraki, Kameda et al. - 1979
Documents on the same site (http://www.cs.brockport.edu/~klakshma/research.html):
Alarm Placement in Systems with Fault Propagation - Lakshmanan, Rosenkrantz, Ravi (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC