Explorer Solving Parity Games on Integer Vectors

We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Furthermore, our cost model assigns token storage costs per time unit to places, and firing costs to transitions. This general model strictly subsumes both priced timed automata and unbounded priced Petri nets. We study the cost of computations that reach a given control-state. In general, a computation with minimal cost may not exist, due to strict inequalities in the time constraints. However, we show that the infimum of the costs to reach a given control-state is computable in the case where all place and transition costs are non-negative. On the other hand, if negative costs are allowed, then the question whether a given control-state is reachable with zero overall cost becomes undecidable. In fact, this negative result holds even in the simpler case of discrete time (i.e., integer-valued clocks).

[1]  L. Dickson Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

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

[3]  C. Petri Kommunikation mit Automaten , 1962 .

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

[5]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[6]  Ernst W. Mayr An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[7]  Rüdiger Valk,et al.  The residue of vector sets with applications to decidability problems in Petri nets , 1985, Acta Informatica.

[8]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[9]  B. Jonsson,et al.  Verifying programs with unreliable channels , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[10]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[11]  Gianfranco Ciardo,et al.  Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis , 1994, Application and Theory of Petri Nets.

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

[13]  David de Frutos-Escrig,et al.  On non-decidability of reachability for timed-arc Petri nets , 1999, PNPM.

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

[15]  David de Frutos-Escrig,et al.  Decidability of Properties of Timed-Arc Petri Nets , 2000, ICATPN.

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

[17]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[18]  Kim G. Larsen,et al.  As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata , 2001, CAV.

[19]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

[20]  Aziz Abdulla and Aletta Nylén Parosh Undecidability of LTL for Timed Petri Nets , 2003 .

[21]  Parosh Aziz Abdulla,et al.  Forward Reachability Analysis of Timed Petri Nets , 2004, FORMATS/FTRTFT.

[22]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[23]  Serge Haddad,et al.  Comparison of Different Semantics for Time Petri Nets , 2005, ATVA.

[24]  Parosh Aziz Abdulla,et al.  Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness , 2006, Log. Methods Comput. Sci..

[25]  Véronique Bruyère,et al.  On the optimal reachability problem of weighted timed automata , 2007, Formal Methods Syst. Des..

[26]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[27]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[28]  Klaus Reinhardt,et al.  Reachability in Petri Nets with Inhibitor Arcs , 2008, RP.

[29]  Marcin Jurdzinski,et al.  Concavely-Priced Timed Automata , 2008, FORMATS.

[30]  Parosh Aziz Abdulla,et al.  Minimal Cost Reachability/Coverability in Priced Timed Petri Nets , 2009, FoSSaCS.

[31]  Parosh Aziz Abdulla,et al.  Computing Optimal Coverability Costs in Priced Timed Petri Nets , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[32]  Kim G. Larsen,et al.  Quantitative analysis of real-time systems using priced timed automata , 2011, Commun. ACM.

[33]  Rémi Bonnet The Reachability Problem for Vector Addition System with One Zero-Test , 2011, MFCS.

[34]  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.