What Makes Petri Nets Harder to Verify: Stack or Data?

We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lipton, can be adapted and extended to obtain new lower bounds for the coverability problem for two prominent classes of systems based on Petri nets: Ackermann-hardness for unordered data Petri nets, and Tower-hardness for pushdown vector addition systems.

[1]  Philippe Schnoebelen,et al.  The Power of Priority Channel Systems , 2013, CONCUR.

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

[3]  Parosh Aziz Abdulla,et al.  Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..

[4]  Philippe Schnoebelen,et al.  Multiply-Recursive Upper Bounds with Higman's Lemma , 2011, ICALP.

[5]  Jérôme Leroux,et al.  Linear combinations of unordered data vectors , 2016, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[6]  Grégoire Sutre,et al.  On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension , 2015, ICALP.

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

[8]  Philippe Schnoebelen,et al.  Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma , 2010, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[9]  Ranko Lazic.  The reachability problem for vector addition systems with a stack is not elementary , 2013, ArXiv.

[10]  Sylvain Schmitz,et al.  The Complexity of Coverability in ν-Petri Nets , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[11]  Mohamed Faouzi Atig,et al.  Approximating Petri Net Reachability Along Context-free Traces , 2011, FSTTCS.

[12]  Grégoire Sutre,et al.  On Boundedness Problems for Pushdown Vector Addition Systems , 2015, RP.

[13]  Sylvain Schmitz,et al.  Complexity Hierarchies beyond Elementary , 2013, TOCT.

[14]  Slawomir Lasota,et al.  Automata theory in nominal sets , 2014, Log. Methods Comput. Sci..

[15]  Kurt Jensen,et al.  Coloured Petri Nets , 1996, Monographs in Theoretical Computer Science. An EATCS Series.

[16]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[17]  Fernando Rosa-Velardo,et al.  Decidability and complexity of Petri nets with unordered data , 2011, Theor. Comput. Sci..

[18]  Francisca Santana Robles,et al.  Coloured Petri Nets Basic Concepts, Analysis Methods and Practical Use , 2015 .

[19]  Grégoire Sutre,et al.  Hyper-Ackermannian bounds for pushdown vector addition systems , 2014, CSL-LICS.

[20]  Slawomir Lasota,et al.  Coverability Trees for Petri Nets with Unordered Data , 2016, FoSSaCS.

[21]  Philippe Schnoebelen,et al.  The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[22]  Fernando Rosa-Velardo,et al.  Ordinal recursive complexity of Unordered Data Nets , 2017, Inf. Comput..

[23]  Joël Ouaknine,et al.  Zeno, Hercules, and the Hydra , 2016, ACM Trans. Comput. Log..

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

[25]  Philippe Schnoebelen,et al.  Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets , 2010, MFCS.

[26]  Normann Decker,et al.  On Freeze LTL with Ordered Attributes , 2016, FoSSaCS.

[27]  Philippe Schnoebelen,et al.  The Ordinal Recursive Complexity of Lossy Channel Systems , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.