Complexity and compilability of diagnosis and recovery of graph-based systems

DOI10.1002/INT.20106zbMath1101.68597OpenAlexW1981290406MaRDI QIDQ5706510

Paolo Liberatore

Publication date: 7 November 2005

Published in: International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/int.20106

zbMATH Keywords

faulty alarms

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Maximal Flow Through a Network
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity and compilability of diagnosis and recovery of graph-based systems