Dept. of Mechanical Engineering and Automation;
Harbin Institute of Technology;
Harbin 150001;
China;
Dept. of Mechanical Engineering and Automation;
Harbin Institute of Technology;
Harbin 150001;
Chinan the MAS;
system goal task can be decomposed into many transactions;
which will be achieved by special agents distributed in different physical space. Due to complex coupling relations among transactions;
transactions may form Waiting-Circle resulting in deadlock. Concerning the problem;
this paper proposes two theorems developed for Waiting-Circle detection in transaction set and ensures the implement of goal task decomposition result. Furthermore;
Circle-First Search is put forward to search all of the Waiting-Circle;
which prnvide the basic guideline for decomposing goal task again and eliminate Waiting-Circle.;
