Solving Parity Games on Integer Vectors

We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity games on vector addition systems with states (vass) and multidimensional energy parity games. We show that the multidimensional energy parity game problem is inter-reducible with a subclass of single-sided parity games on vass where just one player can modify the integer counters and the opponent can only change control-states. Our main result is that the minimal elements of the upward-closed winning set of these single-sided parity games on vass are computable. This implies that the Pareto frontier of the minimal initial credit needed to win multidimensional energy parity games is also computable, solving an open question from the literature. Moreover, our main result implies the decidability of weak simulation preorder/equivalence between finite-state systems and vass, and the decidability of model checking vass with a large fragment of the modal μ-calculus.

[1]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[2]  R. V. Glabbeek.  The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR , 2007 .

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

[4]  Krishnendu Chatterjee,et al.  Generalized Mean-payoff and Energy Games , 2010, FSTTCS.

[5]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

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

[7]  Uppsala,et al.  Explorer Solving Parity Games on Integer Vectors , 2013 .

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

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

[10]  Parosh Aziz Abdulla,et al.  Deciding Monotonic Games , 2003, CSL.

[11]  W. Marsden.  I and J , 2012 .

[12]  Tomás Brázdil,et al.  Reachability Games on Extended Vector Addition Systems with States , 2010, ICALP.

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

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

[15]  Krishnendu Chatterjee,et al.  Energy Parity Games , 2010, ICALP.

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

[17]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

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

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

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

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

[22]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

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

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

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

[26]  Peter Habermehl.  On the Complexity of the Linear-Time mu -calculus for Petri-Nets , 1997, ICATPN.

[27]  Krishnendu Chatterjee,et al.  Strategy synthesis for multi-dimensional quantitative objectives , 2012, Acta Informatica.

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

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

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

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

[32]  Jean-François Raskin,et al.  Games for Counting Abstractions , 2005, AVoCS.

[33]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

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

[35]  Daniel Kirsten.  Alternating Tree Automata and Parity Games , 2001, Automata, Logics, and Infinite Games.

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

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

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

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

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

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

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

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

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

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

[46]  Parosh Aziz Abdulla,et al.  The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems , 2012, LATA.

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

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

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