Hierarchical Cost-Parity Games

Cost-parity games are a fundamental tool in system design for the analysis of reactive and distributed systems that recently have received a lot of attention from the formal methods research community. They allow to reason about the time delay on the requests granted by systems, with a bounded consumption of resources, in their executions. In this paper, we contribute to research on Cost-parity games by combining them with hierarchical systems, a successful method for the succinct representation of models. We show that determining the winner of a Hierarchical Cost-parity Game is PSpace-Complete, thus matching the complexity of the proper special case of Hierarchical Parity Games. This shows that reasoning about temporal delay can be addressed at a free cost in terms of complexity.

[1]  Aniello Murano,et al.  Concurrent Multi-Player Parity Games , 2016, AAMAS.

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

[3]  Yoram Hirshfeld,et al.  Promptness in omega-Regular Automata , 2010, ATVA.

[4]  Rajeev Alur,et al.  Model checking of hierarchical state machines , 1998, TOPL.

[5]  Aniello Murano,et al.  Synthesis of hierarchical systems , 2011, Sci. Comput. Program..

[6]  Orna Kupferman,et al.  From liveness to promptness , 2009, Formal Methods Syst. Des..

[7]  Aniello Murano,et al.  Improved model checking of hierarchical systems , 2010, Inf. Comput..

[8]  Rajeev Alur,et al.  Analysis of recursive state machines , 2001, TOPL.

[9]  Martin Zimmermann,et al.  Parity and Streett Games with Costs , 2012, Log. Methods Comput. Sci..

[10]  Sampath Kannan,et al.  Communicating Hierarchical State Machines , 1999, ICALP.

[11]  Orna Kupferman,et al.  Module Checking , 1996, Inf. Comput..

[12]  Giuseppe De Giacomo,et al.  An Automata-Theoretic Approach to , 2009 .

[13]  Markus Lohrey,et al.  Fixpoint Logics on Hierarchical Structures , 2005, FSTTCS.

[14]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[15]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[16]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic , 2008, 25 Years of Model Checking.

[17]  Jørgen Staunstrup.  Specification and Verification of Concurrent Programs , 1979 .

[18]  M. Paterson,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA 2006.

[19]  Aniello Murano,et al.  On Promptness in Parity Games , 2015, Fundam. Informaticae.

[20]  Krishnendu Chatterjee,et al.  Mean-payoff parity games , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).