A UCB-Based Tree Search Approach to Joint Verification-Correction Strategy for Large-Scale Systems

Peng Xu, Xinwei Deng, Alejandro Salado

Research output: Contribution to journalArticlepeer-review


Verification planning is a sequential decision-making problem that specifies a set of verification activities (VAs) and correction activities (CAs) at different phases of system development. While VAs are used to identify errors and defects, CAs also play important roles in system verification as they correct the identified errors and defects. However, current planning methods only consider VAs as decision choices. Because VAs and CAs have different activity spaces, planning a joint verification-correction strategy (JVCS) is challenging, especially for large-scale systems. Here, we introduce a UCB-based tree search approach to search for near-optimal JVCSs. First, verification planning is simplified as repeatable bandit problems and an upper confidence bound rule for repeatable bandits (UCBRBs) is presented with the optimal regret bound. Next, a tree search algorithm is proposed to search for feasible JVCSs. A tree-based ensemble learning model is also used to extend the tree search algorithm to handle local optimality issues. The proposed approach is evaluated on the notional case of a communication system.

Original languageEnglish (US)
Pages (from-to)5430-5441
Number of pages12
JournalIEEE Transactions on Systems, Man, and Cybernetics: Systems
Issue number9
StatePublished - Sep 1 2023


  • Bayesian network (BN)
  • multiarmed bandit problem
  • random forest regression (RFR)
  • sequential decision-making
  • verification planning

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Computer Science Applications


Dive into the research topics of 'A UCB-Based Tree Search Approach to Joint Verification-Correction Strategy for Large-Scale Systems'. Together they form a unique fingerprint.

Cite this