| Article ID: | iaor1990323 |
| Country: | United States |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 482 |
| End Page Number: | 485 |
| Publication Date: | Apr 1990 |
| Journal: | IEEE Transactions On Automatic Control |
| Authors: | LaFortune S., Yoo H. |
| Keywords: | petri nets |
The authors compare various classes of Petri net languages. They present a new constructive proof of the equivalence, from the point of view of descriptive power, of ‘general’ Petri nets and ‘restricted’ Petri nets (no multiple arcs nor self-loops are allowed in the latter class). The authors also comment on the descriptive power of Petri nets versus that of finitely recursive processes.