We compare various classes of Petri net languages. We 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). We also comment on the descriptive power of Petri nets versus that of finitely recursive processes.
|Number of pages||4|
|Journal||IEEE Transactions on Automatic Control|
|Publication status||Published - 1990 Apr|
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering