To prevent spam users, you can only post on this forum after registration, which is by invitation. If you want to post on the forum, please send me a mail (h DOT m DOT w DOT verbeek AT tue DOT nl) and I'll send you an invitation in return for an account.
how to draw a reachibility graph
Hi,
i just started learning about petri nets. To understand the petri nets for modelling, i wanted to construct a petri net graph with say n=4. I read about tower of hanoi problem on wikipedia, but i dont get how i should model this system with L type petri net extensions. can anybody tell me how i should work on this system?
I read about the Tower of Hanoi problem form wikipedia.
thanks
Howdy, Stranger!
Categories
- 1.6K All Categories
- 45 Announcements / News
- 225 Process Mining
- 6 - BPI Challenge 2020
- 9 - BPI Challenge 2019
- 24 - BPI Challenge 2018
- 27 - BPI Challenge 2017
- 8 - BPI Challenge 2016
- 68 Research
- 1K ProM 6
- 394 - Usage
- 288 - Development
- 9 RapidProM
- 1 - Usage
- 7 - Development
- 54 ProM5
- 19 - Usage
- 187 Event Logs
- 32 - ProMimport
- 75 - XESame