Nets of Reactive Processes (NRP) is a computing model defined in the following way:
A net is made of processes which execute in parallel and communicate through channels.
Channels are unbounded first-in/first-out files.
To communicate, processes can take informations from their input channels or can put informations into their output channels.
Processes are reactive programs which share the same notion of an instant: a run of a net means a run of each of the processes belonging to it.
There is no possibility to know that a channel is empty at a given instant, before the end of this instant; thus reaction to emptyness is always postponed to the next instant. This is the exact counterpart for channels of the basic principle of SugarCubes for events.
In this paper we define channels, the notion of a reactive process, and the notion of a reactive machine for reactive nets. We give the definition of some basic processes and use them to code two small examples.
All these definitions are in SugarCubes presented in the paper: