🚀 go-pugleaf

In article <8EikmEAmxIvzEwqa@almide.demon.co.uk>, Alexander Anderson
<DELETE_THIS.sandy@almide.demon.co.uk> writes
>    This is completely unrelated to my original aim, but where do I find 
>out about proving properties of parallel systems?  It really bugs me 
>that I only have a gut feeling that it's working.

May I suggest asking this question on comp.sys.transputer? There are a
lot of people there interested in parallel systems. There was a recent
post (if your newsserver goes back 14 days, it will probably still have
it, and it is not a high traffic group) about people working on adding
"theoretically pure" parallelism to Java - they reckoned that Java's
intrinsic parallelism was very impure (I pass no comment).

Taking your thread title, one of their examples came from "modelling"
the behaviour in the canteen during a worksop, by which one person
proved empirically that a certain algorithm could lead to starvation, if
not deadlock. The problem was solved by human override by hungry
participants of the algorithm.

If the post is not there, hunt at University of Kent at Cantutrbury
(...ukc.ac.uk) - they are a centre of info on this sort of thing; many
of the web pages in their posts were to this.

-- 
Alec Cawley
Newbury
Berks, UK