Arthur Bernstein
Abstract
In a recent paper C.A.R. Hoare outlined a language for concurrent programming. Guarded commands and nondeterminism are two features of the language. This paper points out two problems that arise in connection with these features and addresses one of them.
- 1 DIJKSTRA, E.W. Guarded commands, nondeterrninacy and formal derivation of programs. Comm. ACM 18, 8 (Aug. 1975), 453-457. Google Scholar
- 2 HOARE, C.A.R. Communicating sequential processes. Comm. ACM 21, 8 (Aug. 1978), 666-677. Google Scholar
- 3 KIEBURTZ, R., AND SILBERSCHATZ, A. Comments on "Communicating sequential processes." ACM Trans. Program. Lang. Syst. 1, 2 (Oct. 1979), 218-225. Google Scholar
- 4 SCH~WER, F.B., A~D BERNSTEI~, A.J. Mechanisms for specifying scheduling policies. Tech. Rep. 79-365, Dep. Comput. Sci., Cornell Univ., Ithaca, N.Y., Jan. 1979. Google Scholar
Index Terms
- Output Guards and Nondeterminism in “Communicating Sequential Processes”
Recommendations
Communicating sequential processes for distributed constraint satisfaction
CSPCONS is a programming language that supports program execution over multiple Prolog processes with constraints. The language is an extended version of Csp-ii, a version of Prolog that supports channel-based communicating processes and TCP/IP ...
Context-dependent nondeterminism for pushdown automata
Pushdown automata using a limited and unlimited amount of nondeterminism are investigated. Moreover, nondeterministic steps are allowed only within certain contexts, i.e., in configurations that meet particular conditions. The relationships of the ...
On the succinctness of nondeterminism
ATVA'06: Proceedings of the 4th international conference on Automated Technology for Verification and AnalysisMuch is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the relative succinctness of the different classes of nondeterministic automata. For ...
Comments