an occam/CSP question

Thread View: comp.sys.transputer

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Howard E. Motteler Fri, 08 Sep 1989 06:05

#252

Author: Howard E. Motteler
Date: Fri, 08 Sep 1989 06:05

16 lines
1017 bytes

Suppose we restrict a "self contained" occam program (no external
input or output) so that componants of an ALT have mutually exclusive
guards---every input has a guard, and at most one guard is true at any
given time in any given ALT.

It would then seem that the sequences of values passed along channels
(the histories of the channels, to borrow a dataflow term) would be
the same for any trace of the program.

Is there an easy proof of this, using CSP?  (Or a counterexample, if
I'm missing something obvious...)

-- 
Howard E. Motteler       |  Dept. of Computer Science
motteler@umbc3.umbc.edu  |  UMBC, Catonsville, MD 21228

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads