Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm)

Conditional Simple Temporal Network (CSTN) is a constraint-based graph-formalism for conditional temporal planning. It offers a more flexible formalism than the equivalent CSTP model of Tsamardinos et al. (2003), from which it was derived mainly as a sound formalization. Three notions of consistency arise for CSTNs: weak, strong, and dynamic. Dynamic consistency is the most interesting notion, but it is also the most challenging and it was conjectured to be hard to assess. Tsamardinos et al. (2003) gave a doubly-exponential time algorithm for checking dynamic consistency in CSTNs and to produce an exponentially sized dynamic execution strategy whenever the input CSTN is dynamically-consistent. CSTNs may be viewed as an extension of Simple Temporal Networks (STNs) (Dechter et al., 1991), directed weighted graphs where nodes represent events to be scheduled in time and arcs represent temporal distance constraints between pairs of events. Recently, STNs have been generalized into Hyper Temporal Networks (HyTNs), by considering weighted directed hypergraphs where each hyperarc models a disjunctive temporal constraint named hyperconstraint; being directed, the hyperarcs can be either multi-head or multi-tail. The computational equivalence between checking consistency in HyTNs and determining winning regions in Mean Payoff Games (MPGs) was also pointed out; MPGs are a family of 2-player infinite pebble games played on finite graphs, which is well known for having applications in model-checking and formal verification. In this work we introduce the Conditional Hyper Temporal Network (CHyTN) model, a natural extension and generalization of both the CSTN and the HyTN model which is obtained by blending them together. We show that deciding whether a given CSTN or CHyTN is dynamically-consistent is coNP-hard; and that deciding whether a given CHyTN is dynamically-consistent is PSPACE-hard, provided that the input instances are allowed to include both multi-head and multi-tail hyperarcs. In light of this, we continue our study by focusing on CHyTNs that allow only multi-head hyperarcs, and we offer the first deterministic (pseudo) singly-exponential time algorithm for the problem of checking the dynamic consistency of such CHyTNs, also producing a dynamic execution strategy whenever the input CHyTN is dynamically-consistent. Since CSTNs are a special case of CHyTNs, as a byproduct this provides the first sound-and-complete (pseudo) singly-exponential time algorithm for checking dynamic consistency in CSTNs. The proposed algorithm is based on a novel connection between CHyTNs and MPGs; due to the existence of efficient pseudo-polynomial time algorithms for MPGs, it is quite promising to be competitive in practice. The presentation of such connection is mediated by the HyTN model. In order to analyze the time complexity of the algorithm, we introduce a refined notion of dynamic consistency, named-dynamic consistency, and present a sharp lower bounding analysis on the critical value of the reaction time e where a CHyTN transits from being, to not being, dynamically-consistent. The proof technique introduced in this analysis ofˆeofˆ ofˆe is applicable more generally when dealing with linear difference constraints which include strict inequalities.

[1]  Luke Hunsberger,et al.  The Dynamic Controllability of Conditional STNs with Uncertainty , 2012, ArXiv.

[2]  Luke Hunsberger,et al.  A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks , 2015, 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME).

[3]  David E. Smith,et al.  Bridging the gap between planning and scheduling , 2000, The Knowledge Engineering Review.

[4]  Krishnendu Chatterjee,et al.  Polynomial-Time Algorithms for Energy Games with Special Weight Structures , 2012, Algorithmica.

[5]  Romeo Rizzi,et al.  Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking , 2015, 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME).

[6]  Romeo Rizzi,et al.  Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games , 2017, Algorithmica.

[7]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[8]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[9]  Carlo Combi,et al.  Representing Business Processes Through a Temporal Data-Centric Workflow Modeling Language: An Application to the Management of Clinical Pathways , 2014, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[10]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[11]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[12]  Martha E. Pollack,et al.  Efficient solution techniques for disjunctive temporal reasoning problems , 2003, Artif. Intell..

[13]  Johann Eder,et al.  Time Constraints in Workflow Systems , 1999, CAiSE.

[14]  Romeo Rizzi,et al.  Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks , 2016, 2016 23rd International Symposium on Temporal Representation and Reasoning (TIME).

[15]  Romeo Rizzi,et al.  Hyper temporal networks , 2015, Constraints.

[16]  Marco Roveri,et al.  Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation , 2014, 2014 21st International Symposium on Temporal Representation and Reasoning.

[17]  Jakub Chaloupka,et al.  Using Strategy Improvement to Stay Alive , 2010, Int. J. Found. Comput. Sci..

[18]  Xavier Allamigeon,et al.  The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average , 2014, ICALP.

[19]  Luke Hunsberger,et al.  An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty , 2013, ICAART.

[20]  G. P. Bhattacharjee,et al.  Temporal representation and reasoning in artificial intelligence: A review , 2001 .

[21]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[22]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[23]  Javier Esparza.  Automata, Languages, and Programming , 2014, Lecture Notes in Computer Science.

[24]  Thierry Vidal,et al.  CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning , 2003, Constraints.

[25]  Lubos Brim,et al.  Using Strategy Improvement to Stay Alive , 2012, Int. J. Found. Comput. Sci..

[26]  L. Brim,et al.  Faster algorithms for mean-payoff games , 2011, Formal Methods Syst. Des..

[27]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[28]  Luke Hunsberger,et al.  Checking the Dynamic Consistency of Conditional Temporal Networks with Bounded Reaction Times , 2016, ICAPS.

[29]  Martha E. Pollack,et al.  Applying Local Search to Disjunctive Temporal Problems , 2005, IJCAI.

[30]  Luke Hunsberger,et al.  Checking the dynamic consistency of conditional simple temporal networks with bounded reaction times , 2016, ICAPS 2016.

[31]  Carlo Combi,et al.  Conceptual modeling of flexible temporal workflows , 2012, TAAS.

[32]  Angelo Oddi,et al.  Constraint-Based Strategies for the Disjunctive Temporal Problem: Some New Results , 2014 .

[33]  Sushil Jajodia,et al.  Temporal Reasoning in Workflow Systems , 2002, Distributed and Parallel Databases.

[34]  Romeo Rizzi,et al.  A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games , 2014, 2014 21st International Symposium on Temporal Representation and Reasoning.