Legality and Other Properties of Graph Models of Computations

@article{Baer1970LegalityAO,
  title={Legality and Other Properties of Graph Models of Computations},
  author={Jean-Loup Baer and Daniel P. Bovet and Gerald Estrin},
  journal={J. ACM},
  year={1970},
  volume={17},
  pages={543-554}
}
Directed graphs having logical control associated with each vertex have been introduced as models of computational tasks for automatic assignment and sequencing on parallel processor systems. A brief review of their properties is given. A procedure to test the “legality” of graphs in this class is described, and leads to algorithms for counting the number of all possible executions (AND-type subgraphs), and for evaluating the probability of ever reaching a given vertex in the graph. Numerical… CONTINUE READING