By Topic

A model and a proof system for parallel and distributed processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kavi, K.M. ; Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA ; Deshpande, A.K.

An approach to modeling a network of processes based on dataflow principles is presented. A dataflow graph, which represents a process, is defined in terms of input and output links, which represent the ports for external communication, and actors, which represent the functionality. The flow of data on links makes it possible to define markings which in turn provide an abstraction for the state of the graph/process. Events in the graph that define transitions of markings are partially ordered. A formal algebra and a first-order proof system for graph compositions using these markings is also presented. The dataflow graph model of computation facilitates the representation of concurrency at any level of abstraction

Published in:

System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on  (Volume:ii )

Date of Conference:

2-5 Jan 1990