Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets with transfer and reset operations defined for black indistinguishable tokens (Affine Well-Structured Nets), extensions in which tokens carry pure names dynamically generated with special ν-transitions (ν-APN), and extensions in which tokens carry data taken from a linearly ordered domain (Data nets and CMRS). These models are well-structured transitions systems. In order to compare these models we consider the families of languages they recognize, using coverability as accepting condition. With this criterion, we prove that ν-APNs are in between AWNs and Data Nets/CMRS. Moreover, we prove that the family of languages recognized by ν-APNs satisfies a good number of closure properties, being a semi-full AFL. These results extend the currently known classification of the expressive power of well-structured transition systems with new closure properties and new relations between extensions of Petri nets.
Unable to display preview. Download preview PDF.
- 1.Abdulla, P., Delzanno, G.: On the coverability problem for constrained multiset rewriting. In: AVIS, an ETAPS workshop (2006)Google Scholar
- 10.Kummer, O.: Undecidability in object-oriented petri nets. Petri Net Newsletter 59, 18–23 (2000)Google Scholar
- 12.Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs (1981)Google Scholar