The Petri Net Method of Task Decomposition and Its Validity Research

Task decomposition is the key to multi-agent system implementation.It is necessary to describe and validate the task decomposition structure by a formal method.The task decomposition is modeled by Petri Nets for the ordinary logical expressions of task decomposition,and the Petri net of task decomposition is obtained,after deleting unreasonable structure of task decomposition,the Petri net of valid task decomposition is obtained.By checking whether the Petri net of valid task decomposition exists,the task decomposition is valid or not can be judged.Furthermore,for any finite P/T net,the sufficient conditions for judging if invalid task decomposition structure exists,are proposed,and accordingly that only first-level live transitions exist in the valid task decomposition Petri net system is proven.The fundamental problem is solved by combination of task decomposition validation and liveness of Petri net system.