Title :
A model and a proof system for parallel and distributed processes
Author :
Kavi, Krishna M. ; Deshpande, Akshay K.
Author_Institution :
Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA
Abstract :
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
Keywords :
distributed processing; parallel programming; abstraction; actors; dataflow principles; distributed processes; first-order proof system; formal algebra; graph compositions; model; modeling; parallel processes; ports; proof system; representation of concurrency; Algebra; Computational modeling; Computer science; Concurrent computing; Control systems; Educational programs; Parallel processing; Process control; Safety;
Conference_Titel :
System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on
Conference_Location :
Kailua-Kona, HI
DOI :
10.1109/HICSS.1990.205209
