基于时间覆盖的时间基本Petri网可达性分析
Reachability Analysis of Time Basic Petri Nets: a Time Coverage Approach
摘要:
我们介绍了一种技术的可达性分析的时间基本(TB)Petri网,一个强大的形式主义的实时的系统的时间约束表示为间隔,表示可能的过渡发射时间,其边界是功能的标记的时间描述。该技术包括建立一个依赖于一种时间覆盖的符号可达图,并克服了TB网的唯一可用分析器的局限性,进而基于对(可能是无限的)可达树的时间有界检查。图的构造算法已自动化的工具集,简要介绍了在该文件中,连同其主要功能和分析能力。一个运行的例子是在整个文件中使用草图的符号图的建设。描述一个小的真实系统的用例-运行的例子是摘录-已经被用来对技术和工具集进行基准测试。文中还介绍了试验的主要结果。正在进行的工作,在与模型检查引擎集成的角度来看,不久进行了讨论。
英文摘要:
We introduce a technique for reachability analysis of Time-Basic (TB) Petri nets, a powerful formalism for real- time systems where time constraints are expressed as intervals, representing possible transition firing times, whose bounds are functions of marking's time description. The technique consists of building a symbolic reachability graph relying on a sort of time coverage, and overcomes the limitations of the only available analyzer for TB nets, based in turn on a time-bounded inspection of a (possibly infinite) reachability-tree. The graph construction algorithm has been automated by a tool-set, briefly described in the paper together with its main functionality and analysis capability. A running example is used throughout the paper to sketch the symbolic graph construction. A use case describing a small real system - that the running example is an excerpt from - has been employed to benchmark the technique and the tool-set. The main outcome of this test are also presented in the paper. Ongoing work, in the perspective of integrating with a model-checking engine, is shortly discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。