Formal methods for the validation of automotive product configuration data

In the automotive industry, the compilation and maintenance of correct product configuration data is a complex task. Our work shows how formal methods can be applied to the validation of such business critical data. Our consistency support tool BIS works on an existing database of Boolean constraints expressing valid configurations and their transformation into manufacturable products. Using a specially modified satisfiability checker with an explanation component, BIS can detect inconsistencies in the constraints set and thus help increase the quality of the product data. BIS also supports manufacturing decisions by calculating the implications of product or production environment changes on the set of required parts. In this paper, we give a comprehensive account of BIS: the formalization of the business processes underlying its construction, the modifications of satisfiability-checking technology we found necessary in this context, and the software technology used to package the product as a client–server information system.

[1]  Hans Kleine Büning,et al.  On the structure of some classes of minimal unsatisfiable formulas , 2003, Discret. Appl. Math..

[2]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[3]  Andreas Günter,et al.  Knowledge-Based Configuration: Survey and Future Directions , 1999, XPS.

[4]  Anthony Hall,et al.  Seven myths of formal methods , 1990, IEEE Software.

[5]  Oliver Kullmann,et al.  An application of matroid theory to the SAT problem , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[6]  A. Watson,et al.  OMG (Object Management Group) architecture and CORBA (common object request broker architecture) specification , 2002 .

[7]  Susan L Ge,et al.  Applications of Formal Methods : Developing Virtuoso Software , 2022 .

[8]  Mark E. Stickel,et al.  Proving Properties of Rule-Based Systems , 1992, Int. J. Softw. Eng. Knowl. Eng..

[9]  Daniel Sabin,et al.  Product Configuration Frameworks - A Survey , 1998, IEEE Intell. Syst..

[10]  V. Vinay,et al.  Branching rules for satisfiability , 1995, Journal of Automated Reasoning.

[11]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[12]  Wolfgang Küchlin,et al.  Proving Consistency Assertions for Automotive Product Data Management , 2000, Journal of Automated Reasoning.

[13]  Wolfgang Küchlin,et al.  PARALLEL CONSISTENCY CHECKING OF AUTOMOTIVE PRODUCT DATA , 2002 .

[14]  Albert Haag,et al.  Sales Configuration in Business Processes , 1998, IEEE Intell. Syst..

[15]  Massachusett Framingham,et al.  The Common Object Request Broker: Architecture and Specification Version 3 , 2003 .

[16]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[17]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[18]  David Lorge Parnas,et al.  An Invitation to Formal Methods , 1996, Computer.

[19]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[20]  Reijo Sulonen,et al.  Representing Configuration Knowledge With Weight Constraint Rules , 2001, Answer Set Programming.

[21]  Dan Craigen,et al.  Formal Methods Reality Check: Industrial Usage , 1993, FME.

[22]  Jim Woodcock,et al.  Guest Editors' Introduction-Special Issues for FM '99: The First World Congress On Formal Methods in the Development of Computing Systems , 2000, IEEE Trans. Software Eng..

[23]  Susan L. Gerhart,et al.  Applications of Formal Methods: Develoment Virtuoso Software - Guest Editor's Introduction , 1990, IEEE Software.

[24]  Virginia E. Barker,et al.  Expert systems for configuration at Digital: XCON and beyond , 1989, Commun. ACM.

[25]  Jeannette M. Wing.  A specifier's introduction to formal methods , 1990, Computer.

[26]  Jim Woodcock,et al.  Introduction: Special Issues for FM'99, the First World Congress on Formal Methods in the Development of Computing Systems , 2000, Formal Methods Syst. Des..

[27]  Jon R. Wright,et al.  A Knowledge-Based Configurator that Supports Sales, Engineering, and Manufacturing at AT&T Network Systems , 1993, AI Mag..

[28]  Eugene C. Freuder.  Roundtable: The Role of Configuration Knowledge in the Business Process , 1998, IEEE Intell. Syst..

[29]  D. P. Timmermans.  The Business Challenge of Configuration , 1999 .

[30]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[31]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

[32]  John P. McDermott,et al.  R1: A Rule-Based Configurer of Computer Systems , 1982, Artif. Intell..

[33]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[34]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[35]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[36]  Andreas Kaiser.  A SAT-based propositional prover for consistency checking of automotive product data , 2001 .

[37]  BüningHans Kleine,et al.  On the structure of some classes of minimal unsatisfiable formulas , 2003 .

[38]  T. Kaneshige.  Waiting for the Telecommunications Act to deliver , 1996 .

[39]  E.C. Freuder.  The Role of Configuration Knowledge in the Business Process [Configuration Roundtable] , 1998, IEEE Intelligent Systems and their Applications.

[40]  Christos H. Papadimitriou,et al.  The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[41]  Hans Kleine Büning,et al.  An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF , 1998, Annals of Mathematics and Artificial Intelligence.