一种基于Petri网的全覆盖想定生成算法

摘要

Scenario play is an important part in military simulation system. It provides initial state for the running of complex operational sequences and it’s the precondition to obtain the simulation analysis results. Based on the concept of full coverage scenario, an algorithm is proposed to construct the full coverage initial marking or scenario trying to cover all the possible operational events and event sequences. Apply structure theory of Petri nets, take initial marking as the input and the corresponding process net unfolded as the output and analyze the input and the output. Then validate it through a case. The results show that the proposed algorithm is feasible and it’s easy to obtain the full coverage scenario of system.%　　想定是作战仿真系统的重要组成部分，是复杂作战序列仿真运行的初始态势，是获取可信仿真分析结果的前提。在全覆盖想定概念的基础上，提出一种力图遍历所有可能作战事件和事件序列的全覆盖初始标识(想定)的生成算法。应用 Petri 网的网结构理论，通过对视为被仿真系统可能想定的 Petri 网初始标识与该标识下的网事件进程行为的输入/输出分析，并以实例进行验证。实例结果表明：该算法操作性强，能很容易获取系统的全覆盖想定。