On Tue, 2002-05-28 at 18:11, [EMAIL PROTECTED] wrote:
> I cannot give final POE code since I'm not quite sure about the syntax that
> would be used to specify place types. The net could be described similar to
> the small sum test (just list all the transitions together with their arcs,
> the arcs' expressions and the guard and code expressions). For the example
> above this could be
> stepN = {
> arc_in => {
> placeN-1 => {
> type => 'single', # just check one token at a time
> expression => sub { shift; }
> # just consumes one token, enabled as soon as there is one token
> # (that means one work-packet
> }
> },
....
> This is not really more than just writing the steps. But these would occur in
> the correct order, and you could even execute several of these concurrently.
Is this ready for public consumption? I downloaded the first snapshot
and took a peak. The code is well organized. I like what I see. It
seems to be a very promising tool for describing and coding a state
machine. It would make my tutorial as simple as writing down the steps
as you mentioned.
The only barrier is the initial learning curve of CPN. Then again,
having a clearly defined procedure to convert a state machine into code
makes it well worth the effort.
Pete
