This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Formal Definition of Data Flow Graph Models
November 1986 (vol. 35 no. 11)
pp. 940-948
K.M. Kavi, Department of Computer Science Engineering, The University of Texas
In this paper, a new model for parallel computations and parallel computer systems that is based on data flow principles is presented. Uninterpreted data flow graphs can be used to model computer systems including data driven and parallel processors. A data flow graph is defined to be a bipartite graph with actors and links as the two vertex classes. Actors can be considered similar to transitions in Petri nets, and links similar to places. The nondeterministic nature of uninterpreted data flow graphs necessitates the derivation of liveness conditions.
Index Terms:
Petri nets, Bipartite graphs, data flow graphs, deadlocks, liveness, parallel computations
Citation:
K.M. Kavi, B.P. Buckles, U.N. Bhat, "A Formal Definition of Data Flow Graph Models," IEEE Transactions on Computers, vol. 35, no. 11, pp. 940-948, Nov. 1986, doi:10.1109/TC.1986.1676696
Usage of this product signifies your acceptance of the Terms of Use.