Abstract
In this paper we discuss how OBDDs (Ordered Binary Decision Diagrams) can be exploited for the computation of consistency-based diagnoses in Model-Based Diagnosis. Since it is not always possible to efficiently encode the whole system model within a single OBDD, we propose to build a set of OBDDs, each one encoding a portion of the original model. For each portion of the model, we compute an OBDD encoding the set of local diagnoses; the OBDD encoding global diagnoses is then obtained by merging all the local-diagnoses OBDDs. Finally, minimal-cardinality diagnoses can be efficiently computed and extracted.
The paper reports formal results about soundness, completeness and computational complexity of the proposed algorithm. Thanks to the fact that encoding diagnoses is in general much simpler than encoding the whole system model, this approach allows for the successful computation of global diagnoses even if the system model could not be compiled into a single OBDD. This is exemplified referring to a challenging combinatorial digital circuit taken from the ISCAS85 benchmark.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Aloul, I. Markov, K. Sakallah, FORCE: a Fast and Easy-to-Implement Variable-Ordering Heuristic, Proc. Great Lakes Symposium on VLSI — GLSVLSI, 116–119, 2003
B. Bollig, I. Wegener, Improving the Variable Ordering of OBDDs is NP-complete, IEEE Transactions on Computers 45(9), 932–1002, 1994
P. Bertoli, A. Cimatti, M. Roveri, P. Traverso, Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking, Proc. 17th Int. Joint Conf. on AI-IJCAI, 473–478, 2001
L. Chittaro, R. Ranon, R.: Hierarchical Model-Based Diagnosis Based on Structural Abstraction. Artificial Intelligence 155(1–2) (2004) 147–182
A. Darwiche: Model-Based Diagnosis using Structured System Descriptions. Journal of Artificial Intelligence Research 8 (1998) 165–222
A. Darwiche, A Compiler for Deterministic, Decomposable Negation Normal Form, Proc. 18th National Conf. on AI-AAAI, 627–634, 2002
A. Darwiche, New Advances in Compiling CNF to Decomposable Negation Normal Form, Proc. 16th European Conf. on AI-ECAI, 328–332, 2004
R. Bryant, Symbolic Boolean manipulation with Ordered Binary-Decision Diagrams, ACM Computing Surveys 24, 293–318, 1992
J. Kurien, P. P. Nayak, Back to the Future for Consistency-Based Trajectory Tracking, Proc. 17th National Conf. on Artificial Intelligence, 370–377, 2000
A. Schumann, Y. Pencolé, S. Thiébaux, Diagnosis of Discrete-Event Systems using Binary Decision Diagrams, Proc. 15th Int. Workshop on Principles of Diagnosis, 197–202, 2004
J. Sztipanovits, A. Misra, Diagnosis of discrete event systems using Ordered Binary Decision Diagrams, Proc. 7th Int. Workshop on Principles of Diagnosis, 1996
P. Torasso, G. Torta Computing Minimum-Cardinality Diagnoses Using OBDDs, LNAI 2821, 224–238, 2003
G. Torta, P. Torasso, The Role of OBDDs in Controlling the Complexity of Model Based Diagnosis, Proc. 15th Int. Work, on Principles of Diagnosis, 9–14, 2004
B. C. Williams, P. P. Nayak, A Model-Based Approach to Reactive Self-Configuring Systems, Proc. AAAI96, 971–978, 1996
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag London Limited
About this paper
Cite this paper
Torta, G., Torasso, P. (2006). On the Use of OBDDs in Model Based Diagnosis: an Approach Based on the Partition of the Model. In: Bramer, M., Coenen, F., Allen, T. (eds) Research and Development in Intelligent Systems XXII. SGAI 2005. Springer, London. https://doi.org/10.1007/978-1-84628-226-3_24
Download citation
DOI: https://doi.org/10.1007/978-1-84628-226-3_24
Publisher Name: Springer, London
Print ISBN: 978-1-84628-225-6
Online ISBN: 978-1-84628-226-3
eBook Packages: Computer ScienceComputer Science (R0)