An investigation was conducted of the computation power of concurrent processing systems satisfying two conditions: (i) each process created in a system is a straight line program; and (ii) each execution of a process creation event is not controlled by a synchronization mechanism. For this purpose, SPS is defined as a model of concurrent processing systems and SPS languages which represent the sets of valid computation histories of SPS, and model concurrent processing systems satisfying these conditions using SPS. Then, their computation power is investigated using SPS languages from the following viewpoints: (i) inclusion relations among the set of target SPS languages, the set of regular sets, the set of languages which are acceptable by 1-counter automata, the set of context-free languages and the set of context sensitive languages; and (ii) closure properties under set operations such as union, intersection, complementation, concatenation, intersection with a regular set, reversal, homomorphism and shuffle.
|Number of pages||10|
|Journal||Systems, computers, controls|
|Publication status||Published - Jan 1 1984|
All Science Journal Classification (ASJC) codes