AGArjan J. C. van Gemund

Arjan J. C. van Gemund

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Arjan J. C. van Gemund has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • The Diagnostic Competitions

    by Alexander Feldman, Johan de Kleer, Tolga Kurtoglu, Sriram Narasimhan, Scott Poll, David Garcia, Lukas Kuhn, Arjan J. C. van Gemund


  • Open Access

    A Model-Based Active Testing Approach to Sequential Diagnosis

    by Alexander Feldman, Gregory Provan, Arjan van Gemund

    Model-based diagnostic reasoning often leads to a large number of diagnostic hypotheses. The set of diagnoses can be reduced by taking into account extra observations (passive monitoring), measuring additional variables (probing) or executing additional tests (sequential diagnosis/test sequencing). In this paper we combine the above approaches with techniques from Automated Test Pattern Generation (ATPG) and Model-Based Diagnosis (MBD) into a framework called FRACTAL (FRamework for ACtive Testing ALgorithms). Apart from the inputs and outputs that connect a system to its environment, in active testing we consider additional input variables to which a sequence of test vectors can be supplied. We address the computationally hard problem of computing optimal control assignments (as defined in FRACTAL) in terms of a greedy approximation algorithm called FRACTAL-G. We compare the decrease in the number of remaining minimal cardinality diagnoses of FRACTAL-G to that of two more FRACTAL algorithms: FRACTAL-ATPG and FRACTAL-P. FRACTAL-ATPG is based on ATPG and sequential diagnosis while FRACTAL-P is based on probing and, although not an active testing algorithm, provides a baseline for comparing the lower bound on the number of reachable diagnoses for the FRACTAL algorithms. We empirically evaluate the trade-offs of the three FRACTAL algorithms by performing extensive experimentation on the ISCAS85/74XXX benchmark of combinational circuits.

  • Open Access

    Approximate Model-Based Diagnosis Using Greedy Stochastic Search

    by Alexander Feldman, Gregory Provan, Arjan van Gemund

    We propose a StochAstic Fault diagnosis AlgoRIthm, called SAFARI, which trades off guarantees of computing minimal diagnoses for computational efficiency. We empirically demonstrate, using the 74XXX and ISCAS-85 suites of benchmark combinatorial circuits, that SAFARI achieves several orders-of-magnitude speedup over two well-known deterministic algorithms, CDA* and HA*, for multiple-fault diagnoses; further, SAFARI can compute a range of multiple-fault diagnoses that CDA* and HA* cannot. We also prove that SAFARI is optimal for a range of propositional fault models, such as the widely-used weak-fault models (models with ignorance of abnormal behavior). We discuss the optimality of SAFARI in a class of strong-fault circuit models with stuck-at failure modes. By modeling the algorithm itself as a Markov chain, we provide exact bounds on the minimality of the diagnosis computed. SAFARI also displays strong anytime behavior, and will return a diagnosis after any non-trivial inference time.

  • Prioritizing Tests for Fault Localization

    by Alberto Gonzalez-Sanchez, Éric Piel, Rui Abreu, Hans-Gerhard Gross, Arjan J. C. van Gemund


  • Online Fault Localization and Health Monitoring for Software Systems

    by Éric Piel, Alberto Gonzalez-Sanchez, Hans-Gerhard Gross, Arjan J. C. van Gemund

  • Open Access

    Spectrum-Based Sequential Diagnosis (Extended Abstract)

    by Alberto Gonzalez-Sanchez, Rui Abreu, Hans-Gerhard Gross, Arjan J.C. van Gemund

    In fault diagnosis an important performance metric is the accuracy of the multiple-fault diagnosis D returned by a diagnostic algorithm (DA). In many cases diagnostic accuracy is insufficient (D comprises too many candidates). Diagnostic uncertainty can be reduced by supplying more modeling information, and more observation information. Observation information can be in spatial sense (more probing points), and in temporal sense (more tests), the latter of which is the focus of this paper. Ignoring the computational cost of the DA itself, the diagnostic process may be viewed as (1) expending costs to generate observation input to the DA (testing cost Ct), and (2) expending costs to find the actual diagnosis from D returned by the DA by the diagnostician (diagnostic cost Cd). The latter is inverse to diagnostic accuracy (utility) as false positives and negatives in D result in wasted effort by the diagnostician finding the actually faulted components. In sequential diagnosis (SD) one computes the optimal sequence of tests (observations) that, on average, minimizes Ct and Cd. SD approaches are typically found in the (hardware) systems testing domain where system knowledge is encoded in terms of predetermined test matrices, or in the model-based diagnosis domain where system models are available. In the software domain, the domain considered in this paper, the problem of diagnosis has received considerable attention. Due to complexity problems most model-based approaches are limited to small programs and/or must take a single-fault assumption. Typically, statistical approaches are used, that abstract from the program code and compute the correlation between component involvement in tests on the one hand (expressed in terms of a so-called spectra), and the test outcomes (pass/fail) on the other, deriving a ranking of suspect components. While these approaches essentially involve multiple observations (e.g., an entire regression test suite) they do not qualify as SD since the choice of tests is random (a passive diagnosis ap- proach), rather than generating/selecting the next best test based on the diagnosis obtained thus far (an active diagnosis approach). Hence, the decrease of Cd per test is far from optimal. In this paper we present a spectrum-based SD approach and an associated algorithm dubbed SEQUOIA (SEQUencing fOr dIAgnosis) that greedily computes a sequence out of a large set of given tests that delivers near-optimal diagnostic performance in terms of the decay of Cd as function of the number of tests. Unlike statistical techniques, which have insufficient diagnostic accuracy to select the next best test, we use an approximate, Bayesian reasoning approach which provides the required accuracy. Similar to approaches based on a test coverage matrix, the tests are selected from a fixed test set. Unlike multiple-fault, matrix-based approaches, however, our approximate, Baysian approach can handle large system sizes and test set sizes. Furthermore, unlike MBD approaches, no system information is required, other than component test coverage, which is typically known from test execution profiling. To achieve polynomial complexity SEQUOIA uses an approximate information gain computation approach. Synthetic data shows, that the dynamic selection of the next best test based on the observations made so far, allows SEQUOIA to achieve much better decay of diagnostic uncertainty compared to random test sequencing. Real programs, taken from the Siemens set, also show that SEQUOIA has better performance, except when the diagnosis involves ambiguity sets that are too large for the entropy estimation to handle. Future work, therefore, includes solving this problem by a better expansion technique, expanding the MHS in order of posterior probability (which is currently ignored in our prototype approach).

  • Dealing with Uncertainty in Operational Transport Planning

    by J. Zutt, A. van Gemund, M. de Weerdt, C. Witteveen


  • ON THE PERFORMANCE OF FAULT SCREENERS IN SOFTWARE DEVELOPMENT AND DEPLOYMENT

    by Rui Abreu, Alberto González, Peter Zoeteweij, Arjan J. C. van Gemund

  • 2.3.1 Benefits and Costs of Model‐Based Fault Diagnosis for Semiconductor Manufacturing Equipment

    by Jurryt Pietersma, Arjan J.C. van Gemund

    Model‐Based Diagnosis (MBD) is a promising solution for the fault diagnosis of complex systems. In this paper we review the benefits and costs of MBD. Our research is performed in cooperation with ASML which is the world's leading manufacturer of lithography systems for the semiconductor industry. We analyse the current way of working and the benefits that MBD offers. We present the results of practical modeling studies and discuss the benefits, costs, and cost reduction methods. We summarize the current research results and ongoing developments. Our results show that MBD has a high potential for diagnosis in a rapidly innovating industry. The fulfilment of this potential depends on the cost of modeling and the acceptance of MBD as part of broader pursuit for model‐based systems engineering.


  • Modeling and Compilation Aspects of Fault Diagnosis Complexity

    by Jurryt Pietersma, Alexander Feldman, Arjan J.C. Van Gemund

    Model-based diagnosis (MBD) is a promising approach for fast and accurate diagnosis of root cause of failure for complex systems. Critical success factors in MBD are accurate realism of the model and diagnostic inference speed. Both success factors are inherently at conflict. In this paper we demonstrate how to model system components that are typically found in technical systems in a qualitative approach, thereby limiting the need for more variables as well as increased domain resolution. Furthermore we outline the computational trajectory from model to diagnosis, in which we distinguish between (offline) model compilation to an intermediate representation, and the subsequent (on-line) diagnosis step, based on actual observations. We use the fuel system of an Airbus 330 and a scenario based on a real-life incident as leading example. The results show that our framework is well suited for qualitative models and that these models provide a realistic representation and accurate diagnosis. From our results we conclude that the selected knowledge representation can speed-up the diagnostic process to up to two orders of magnitude.