CONCURRENT PROGRAM SCHEME WITH FINITE STATE SCHEDULERS.

Masafumi Yamashita, Namio Honda, Yasuyoshi Inagaki

研究成果: Contribution to journalArticle

抜粋

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.

元の言語英語
ページ(範囲)59-66
ページ数8
ジャーナルSystems, computers, controls
11
発行部数4
出版物ステータス出版済み - 1 1 1980

All Science Journal Classification (ASJC) codes

  • Engineering(all)

フィンガープリント CONCURRENT PROGRAM SCHEME WITH FINITE STATE SCHEDULERS.' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Yamashita, M., Honda, N., & Inagaki, Y. (1980). CONCURRENT PROGRAM SCHEME WITH FINITE STATE SCHEDULERS. Systems, computers, controls, 11(4), 59-66.