| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436533 | Theoretical Computer Science | 2008 | 7 Pages |
Abstract
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
