乘积型Petri网的综合与分析
Synthesis and Analysis of Product-form Petri Nets
摘要：
对于大型马尔可夫模型，“乘积形式”是对稳态行为的明确描述，否则通常难以处理。它首先被引入到Petri网中，然后被应用到马尔可夫Petri网中。在这里，我们解决了三个相关的问题，产品形式的Petri网，这是完全或部分开放：（1）我们提供了一个健全的和完整的一套规则的合成;（2）我们证明了经典问题的精确复杂性，如可达性;（3）我们引入了一个新的子类，规范化常数（一个关键值的产品形式的表达）可以有效地计算。
英文摘要：
For a large Markovian model, a "product form" is an explicit description of the steady-state behaviour which is otherwise generally untractable. Being first introduced in queueing networks, it has been adapted to Markovian Petri nets. Here we address three relevant issues for product-form Petri nets which were left fully or partially open: (1) we provide a sound and complete set of rules for the synthesis; (2) we characterise the exact complexity of classical problems like reachability; (3) we introduce a new subclass for which the normalising constant (a crucial value for product-form expression) can be efficiently computed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
