Dear arunhorne

I had just finished an end-course undergraduation work about the Petri Net Kernel, an almost complete library to handle, represent and analyse Petri Nets of any kind using java (/me quickly wash my mouth with soap). I wrote a tool to build the reachability tree of a given Place / Transition Petri Net. It is a nice data structure, quite usefull to determine if a Petri Net have some "good" properties.

My next step would be contact professor Michael Weber, from the Humboldt Universitšt zu Berlin and ask him to help me to rewrite the entire library to Perl. Maybe you have some interest in this work too. I would love to hear some comments / tips / informations on this subject from you.

I have the firm intention of aquiring a master degree on this subject, and will write professor Weber right now.

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Just Another Perl Monk


In reply to Re: Speculation Time: PetriNets and Reusable Tasks and Data Flows by monsieur_champs
in thread Speculation Time: PetriNets and Reusable Tasks and Data Flows by arunhorne

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":