I.6.4 Model Validation and Analysis
Grinding is one of the effective manufacturing processes with which to produce highly accurate parts with an ultra-fine surface finish. The tool used to remove materials in grinding is called the grinding wheel. Abrasive grains made of extremely hard materials (alumina, silica, cubic boron nitride, and diamond) having a definite grit size but a random shape are bonded on the circumferential surface of the grinding wheel. The fabrication process is controlled so that the wheel exhibits a prescribed structure (in the scale of soft to hard). At the same time, the distribution of grains must follow a prescribed grade (in the scale of dense to open). After the fabrication, the wheel is dressed to make sure of its material removal effectiveness, which itself depends on the surface topography. The topography is quantified by the distribution and density of active abrasive grains located on the circumferential surface, the grains’ protrusion heights, and their pore volume ratio. The prediction of the surface topography mentioned above requires a model that considers the entire manufacturing process and the influences on the grinding wheel properties. This study fills this gap in modelling the grinding wheel by presenting a surface topography model and simulation framework for the effect of the grinding wheel fabrication process on the surface topography. The simulation results have been verified by conducting experiments. This study will thus help grinding wheel manufacturers in developing more effective grinding wheels.
The dissertation describes a practically proven, particularly efficient approach for the verification of digital circuit designs. The approach outperforms simulation based verification wrt. final circuit quality as well as wrt. required verification effort. In the dissertation, the paradigm of transaction based verification is ported from simulation to formal verification. One consequence is a particular format of formal properties, called operation properties. Circuit descriptions are verified by proof of operation properties with Interval Property Checking (IPC), a particularly strong SAT based formal verification algorithm. Furtheron, a completeness checker is presented that identifies all verification gaps in sets of operation properties. This completeness checker can handle the large operation properties that arise, if this approach is applied to realistic circuits. The methodology of operation properties, Interval Property Checking, and the completeness checker form a symbiosis that is of particular benefit to the verification of digital circuit designs. On top of this symbiosis an approach to completely verify the interaction of completely verified modules has been developed by adaptation of the modelling theories of digital systems. The approach presented in the dissertation has proven in multiple commercial application projects that it indeed completely verifies modules. After reaching a termination criterion that is well defined by completeness checking, no further bugs were found in the verified modules. The approach is marketed by OneSpin Solutions GmbH, Munich, under the names "Operation Based Verification" and "Gap Free Verification".