A.J. Bernstein, `Output guards and non-determinism in CSP,' ACM Toplas , Vol. 2, No. 2, Apr. 1980, pp. 234-238. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Designing Bug-Free Protocols With SPIN - Holzmann (1997) (8 citations) (Correct)
....C91, C94, H94, BG95] As an example of the application of an automated verifier we will consider a protocol for implementing synchronous rendezvous operations in a distributed system: a notoriously difficult problem. The design we consider is documented in [Raynal88, p. 96 103] which is based on [Ber80]. The first step in the verification process is to built a complete and unambiguous, formal specification in the input language of the verifier, consisting of a behavior specification and a requirements specification. The input language of SPIN, called PROMELA (Protocol Meta Language) is based ....
A.J. Bernstein, `Output guards and non-determinism in CSP,' ACM Toplas , Vol. 2, No. 2, Apr. 1980, pp. 234-238.
Tempo: A Declarative Concurrent Programming Language - Gregory, Ramirez (1995) (1 citation) (Correct)
....atomically check all other processes that share . but have not marked it as enabled. If they can all enable . reduce disjunctions in all of the processes, otherwise treat . as disabled. This method, which is comparable to that required for synchronous message passing languages with output guards [3, 5], can be expensive in a parallel implementation. 2. Restrict the language so that each event . can be conditionally enabled in at most one process. If . is conditionally enabled in P, P waits for all other processes to mark . as enabled before enabling it. We adopt this restriction in the ....
Bernstein, A.J. Output guards and non-determinism in CSP. ACM Trans. on Programming Languages and Systems 2, 2, pp. 234-238, 1980.
Tempo: A Declarative Concurrent Programming Language - Steve Gregory (1995) (1 citation) (Correct)
....atomically check all other processes that share E but have not marked it as enabled. If they can all enable E, reduce disjunctions in all of the processes, otherwise treat E as disabled. This method, which is comparable to that required for synchronous message passing languages with output guards [3, 5], can be expensive in a parallel implementation. 2. Restrict the language so that each event E can be conditionally enabled in at most one process. If E is conditionally enabled in P, P waits for all other processes to mark E as enabled before enabling it. We adopt this restriction in the ....
Bernstein, A.J. Output guards and non-determinism in CSP. ACM Trans. on Programming Languages and Systems 2, 2, pp. 234--238, 1980.
An Efficient Algorithm for Multi-Process Shared Events - Vijay Garg (Correct)
No context found.
A.J. Bernstein, "Output Guards and Non-Determinism in CSP", ACM Toplas, 2(2), April 1980, pp 234-238.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC