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.

[1]  Parosh Aziz Abdulla,et al.  Comparing the Expressive Power of Well-Structured Transition Systems , 2007, CSL.

[2]  Wojciech Rytter,et al.  On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[3]  Jean-François Raskin,et al.  Well-structured languages , 2007, Acta Informatica.

[4]  Undecidability in Object-Oriented Petri Nets , 2000 .

[5]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[6]  Fernando Rosa-Velardo,et al.  On the Expressiveness of Mobile Synchronizing Petri Nets , 2007, SecCO@CONCUR.

[7]  Andrew D. Gordon,et al.  Notes on Nominal Calculi for Security and Mobility , 2000, FOSAD.

[8]  P. Abdulla,et al.  On the Coverability Problem for Constrained Multiset Rewriting , 2008 .

[9]  Alain Finkel,et al.  Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

[10]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[11]  Pierre McKenzie,et al.  A well-structured framework for analysing petri net extensions , 2004, Inf. Comput..

[12]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[13]  Joël Ouaknine,et al.  Nets with Tokens which Carry Data , 2008, Fundam. Informaticae.

[14]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[15]  Parosh Aziz Abdulla,et al.  A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations , 2009, LATA.

[16]  Fernando Rosa-Velardo,et al.  Name Creation vs. Replication in Petri Net Systems , 2008, Fundam. Informaticae.