DESIGN OF STEADY-STATE BEHAVIOR OF CONCURRENT REPETITIVE PROCESSES - AN ALGEBRAIC APPROACH

This paper addresses the problem of designing the steady-state behavio r of a set of repetitive processes competing for access to common reso urces, Its objective is to develop algebraic formulae that express sys tem behavior as a function of the characteristics of the component pro cesses and synchronization protocols involved, Based on a matrix repre sentation proposed,conditions are developed that guarantee that the sy stem will achieve a steady state. A composition operator-a tool for sy nthesizing a chain of repetitive processes-is defined, and its applica tion to the design of repetitive systems with required parameters is c onsidered, It is also shown that the composition operator supplemented with an appropriate synchronization protocol makes it possible to pre vent starvation occurrence. Finally, extension of the results to other selected topologies is discussed.