Isomorphisms Between Petr Nets and Dataflow Graphs

Authors:
Krishna M. Kavi;Billy P. Buckles;U. Narayan Bhat
Affiliations:
Univ. of Texas at Arlington, Arlington;Tulane Univ., New Orleans, LA;Southern Methodist Univ., Dallas, TX
Venue:
IEEE Transactions on Software Engineering
Year:
1987

Citing 0
Cited 6

A Formal Definition of Data Flow Graph Models

IEEE Transactions on Computers
A subclass of Petri Nets as design abstraction for parallel architectures

ACM SIGARCH Computer Architecture News
Design methodology management—a CAD framework initiative perspective

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Constructive Protocol Specification Using Cicero

IEEE Transactions on Software Engineering
Modeling Multithreaded Applications Using Petri Nets

International Journal of Parallel Programming
Regular paper: Temporal analysis of data flow control systems

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.