Issue No.10 - October (1987 vol.13)
K.M. Kavi , Department of Computer Science Engineering, University of Texas
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.
timed Petri nets, Dataflow graphs, free choice nets, isomorphism, performance analysis
K.M. Kavi, B.P. Buckles, U.N. Bhat, "Isomorphisms Between Petr Nets and Dataflow Graphs", IEEE Transactions on Software Engineering, vol.13, no. 10, pp. 1127-1134, October 1987, doi:10.1109/TSE.1987.232854