On the coverability and reachability languages of monotonic extensions of Petri nets

We apply language theory to compare the expressive power of infinite-state models that extend Petri nets with features like coloured tokens and/or whole place operations. Specifically, we consider extensions of Petri nets in which tokens carry pure names dynamically generated with special @n-transitions (@n-PN) and compare their expressiveness with transfer and reset nets with black indistinguishable tokens (Affine Well-Structured Nets), and nets in which tokens carry data taken from a linearly ordered domain (Data nets and CMRS). All these models are well-structured transition systems. In order to compare these models we consider the families of languages they recognize, using coverability as the accepting condition. With this criterion, we prove that @n-PNs are in between AWNs and Data Nets/CMRS, but equivalent to an extension of @n-PN with whole-place operations. These results extend the currently known classification of the expressive power of well-structured transition systems. Finally, we study several problems regarding (coverability) languages of AWN and @n-PN.

[1]  David de Frutos Escrig,et al.  Decidability and complexity of Petri nets with unordered data , 2011 .

[2]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[3]  Wolfgang Reisig,et al.  Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.

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

[5]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[6]  Fernando Rosa-Velardo,et al.  Ordinal Theory for Expressiveness of Well Structured Transition Systems , 2011, FoSSaCS.

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

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

[9]  Giorgio Delzanno,et al.  Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data , 2010, LATA.

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

[11]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

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

[13]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

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

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

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

[17]  Parosh Aziz Abdulla,et al.  A classification of the expressive power of well-structured transition systems , 2011, Inf. Comput..

[18]  Roland Meyer,et al.  The Downward-Closure of Petri Net Languages , 2010, ICALP.

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

[20]  Kees M. van Hee,et al.  Soundness of Resource-Constrained Workflow Nets , 2005, ICATPN.

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

[22]  Mathias Weske,et al.  Instance Isolation Analysis for Service-Oriented Architectures , 2008, 2008 IEEE International Conference on Services Computing.

[23]  Faron Moller,et al.  Petri Nets and Regular Processes , 1999, J. Comput. Syst. Sci..

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

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