CONCURRENT PROGRAM SCHEME WITH FINITE STATE SCHEDULERS.

A concurrent program scheme (CPS) is proposed as a new model for the description and analysis of concurrent programs. Its descriptive power as well as several basic properties are discussed. The CPS is a system consisting of a finite, fixed number of concurrent processes (a Luckham-Park-Paterson scheme permitting communication statements) and a finite number of finite-state schedulers which are used to synchronize the processes. In order to show its effectiveness, a monitor language is considered which can describe a concurrent program whose processes are ″while″ programs and the synchronization among the processes is achieved by monitor facilites. It is shown that a program written in the monitor language can be described by the CPS very well. In addition, the characteristics of the CPS are examined and the possibility on its formal analysis is indicated.