摘要 : A system is t/t-diagnosable if, provided the number of faulty processors is bounded by t, all faulty processors can be isolated within a set of size at most t with at most one fault-free processor mistaken as a faulty one. The pes... 展开 A system is t/t-diagnosable if, provided the number of faulty processors is bounded by t, all faulty processors can be isolated within a set of size at most t with at most one fault-free processor mistaken as a faulty one. The pessimistic diagnosability of a system G, denoted by f_p(G), is the maximal number of faulty processors so that the system G is t/t-diagnosable. The known results about t_p(G) for alternating group graphs [Inform. Process. Lett. (2015), pp. 151-154]; BC networks [IEEE Trans. Comput. (2005), pp. 176-184]; the k-ary n-cube networks [IEEE Trans. Comput. (1991), pp. 232-237], [Int. J. Comput. Math. (2012), pp. 1-10] etc. have property that cn(G) < 2. In this paper, we study the pessimistic diagnosability of two kinds of graphs with cn(G) ≥ 3, those are: bubble-sort star graphs BS_n and augmented k-ary n-cubes AQ_(n,k), and prove that f_p(BS_n) = 4n - 9forn ≥ 4, t_P(AQ_n,3) = 8n - 11 forn ≥ 4,and t_p(AQ_(n,k)) = 8n - 10forn ≥ 3and k ≥ 4. 收起