Isomorphisms Between Petr Nets and Dataflow Graphs
Isomorphisms Between Petr Nets and Dataflow Graphs
复制标题
Petr 网络和数据流图之间的同构
DOI：
10.1109/tse.1987.232854
复制
发表时间：
1987
影响因子：
7.4
通讯作者：
U. N. Bhat
中科院分区：
文献类型：
--
作者：
K. Kavi;B. Buckles;U. N. Bhat
数据流图是一种通用的计算模型。通过概率解决的不确定性的未解释的Bastlow图被证明是同构的一类Petri网被称为自由选择网。Petri网分析方法在文献中是现成的，这一结果使得这些方法可以访问到Escherlow的研究。然而，组合爆炸会使Petri网分析变得复杂。使用以前已知的技术分解成更小的组件的自由选择网，它表明，在原则上，它是可能的，以确定从组件的特定行为的整体行为的方面。
Dataflow graphs are a generalized model of computation. Uninterpreted dataflow graphs with nondeterminism resolved via probabilities are shown to be isomorphic to a class of Petri nets known as free choice nets. Petri net analysis methods are readily available in the literature and this result makes those methods accessible to dataflow research. Nevertheless, combinatorial explosion can render Petri net analysis inoperative. Using a previously known technique for decomposing free choice nets into smaller components, it is demonstrated that, in principle, it is possible to determine aspects of the overall behavior from the particular behavior of components.