Semantics of finite and infinite networks of concurrent communicating agents . Note that the modularity issues for nets can be investigated without introducing any textual syntax for descriptions of nets. Sometimes operations on nets are defined. He used a textual language NET for describing nets. Different terms of this textual language may describe the same net.
NET are graph equivalent if they describe isomorphic nets.
These seminal works in dataflow nets and in Petri nets inspired and strongly influenced the research of modularity for net models. Note that in these works modularity and compositionality are not clearly distinguished. In our model, a complete communication history for a channel is represented by an infinite stream of finite streams of messages. A complete communication history for a set of channels is represented by a named communication history. 2 F 1 Omega F 2 .