Syntactical properties of unbounded nets of processors

Abstract

We present a formal description of the logical links in an unbounded net of processors. This description is provided by a finite transducer. We prove some syntactical properties of the net : we give decision algorithms for its coherence and connectivity.