Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Speculation Time: PetriNets and Reusable Tasks and Data Flows

by adrianh (Chancellor)
on Jul 01, 2003 at 21:35 UTC ( [id://270646]=note: print w/replies, xml ) Need Help??


in reply to Speculation Time: PetriNets and Reusable Tasks and Data Flows

I'm not really up to speed on Petri Nets, but from what little I know I think that POE would be a good fit for the implementation of the state-machine/graph traversal stuff. Worth looking at anyway.

  • Comment on Re: Speculation Time: PetriNets and Reusable Tasks and Data Flows

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://270646]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others about the Monastery: (2)
As of 2024-04-26 05:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found