Abstract. The basic decision-theoretic troubleshooting task is described in this paper. Dependency sets are defined for a better understanding of dependent actions. It is shown that an optimal troubleshooting sequence is achievable once these sets are solved optimally. Then, an efficient heuristic method is introduced that adjusts action efficiencies myopically and performs a greedy search. Performance of this approach is tested through empirical studies and compared to other methods from the literature.