Alarm placement in systems with fault propagation
From MaRDI portal
Publication:1575642
DOI10.1016/S0304-3975(98)90214-6zbMath0944.68142WikidataQ127932789 ScholiaQ127932789MaRDI QIDQ1575642
K. B. Lakshmanan, S. S. Ravi, Daniel J. Rosenkrantz
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
fault diagnosisapproximation algorithmsNP optimization problemsalarm placementminimum test collection
Related Items (2)
Approximability of identifying codes and locating-dominating codes ⋮ Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Failure propagating simulation and nonfailure paths search in network systems
- On the hardness of approximating minimization problems
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- The Transitive Reduction of a Directed Graph
This page was built for publication: Alarm placement in systems with fault propagation