🚀 go-pugleaf

In article <JIM.DAVIES.92Aug14175257@pierrot.prg.ox.ac.uk>,
Jim.Davies@prg.ox.ac.uk (A Wooden Fish on Wheels) writes:


|>Returning to the point, however... what do I have to say about the hybrid
|>models of CSP, the models which include system state in their semantics?  The
|>answer is: not very much.  Some of these models are custom jobs,
|>tailored to a
|>specific task---such as compiler verification---and some of them are
|>excellent
|>pieces of work, but they shouldn't be confused with standard CSP.

If you are looking for a useful calculus then it might be a good idea to
start by observing that both CSP and Z are already pretty complex
systems. Combining them is asking to produce something so mind boggling
huge and vast that most people will move to something rather smaller of
their own devising. If you have a problem that is entirely concerned
with the problem of Oggla nut distribution in a limited topological
space then one should only look for calculii capable of tacling
structures more complex than tree based solutions if this is of some
benefit, ie simplifies the problem.


Phill Hallam-Baker