It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 2.2K
- Applied Category Theory Course 355
- Applied Category Theory Seminar 4
- Exercises 149
- Discussion Groups 49
- How to Use MathJax 15
- Chat 480
- Azimuth Code Project 108
- News and Information 145
- Azimuth Blog 149
- Azimuth Forum 29
- Azimuth Project 189
- - Strategy 108
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 711
- - Latest Changes 701
- - - Action 14
- - - Biodiversity 8
- - - Books 2
- - - Carbon 9
- - - Computational methods 38
- - - Climate 53
- - - Earth science 23
- - - Ecology 43
- - - Energy 29
- - - Experiments 30
- - - Geoengineering 0
- - - Mathematical methods 69
- - - Meta 9
- - - Methodology 16
- - - Natural resources 7
- - - Oceans 4
- - - Organizations 34
- - - People 6
- - - Publishing 4
- - - Reports 3
- - - Software 21
- - - Statistical methods 2
- - - Sustainability 4
- - - Things to do 2
- - - Visualisation 1
- General 39

Options

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?

Towers of Hanoi problem:(from wikipedia) link below:

http://en.wikipedia.org/wiki/Tower_of_Hanoi

thanks

## Comments

`n=4 or n=3 or any n is the number of disks in tower of hanoi.`

I think the tower of Hanoi problem is not so naturally modeled using a Petri net. I think I see a way to do, but it's not beautiful. Do you want to me to explain it? I could try for n = 2.

`I think the tower of Hanoi problem is not so naturally modeled using a Petri net. I think I see a way to do, but it's not beautiful. Do you want to me to explain it? I could try for n = 2.`

`yes please it would really help, give me a start.`

`I want to see how a petri net looks like for any n, because this is the most difficult part. i am finding it hard to imagine how i should start.`