For the most recent entries see the Petri Nets Newsletter.

Modeling and Performance Bounds for Concurrent Processing.

Mielke, R.R.; Stoughton, J.W.; Som, S.

In: 8th International Conference on Distributed Computing Systems., pages 538-544. Washington: IEEE Comput. Soc. Press, 1988.

Abstract: A novel graph-theoretic model for describing the relation between a decomposed algorithm and its execution in a multiprocessor environment is developed. Called ATAMM, the model consists of a set of Petri-net marked graphs that incorporates the general specifications of a data-flow architecture.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography