R. Barták and O. ?epek, Temporal networks with alternatives: Complexity and model, Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, pp.641-646, 2007.

R. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

C. Bettini, X. S. Wang, and S. Jajodia, Temporal reasoning in workflow systems, Distributed and Parallel Databases, vol.11, issue.3, pp.269-306, 1023.
DOI : 10.1023/A:1014048800604

H. Björklund and S. Vorobyov, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Discrete Applied Mathematics, vol.155, issue.2, pp.210-229, 2007.
DOI : 10.1016/j.dam.2006.04.029

L. Brim and J. Chaloupka, USING STRATEGY IMPROVEMENT TO STAY ALIVE, International Journal of Foundations of Computer Science, vol.340, issue.03, pp.585-608, 2012.
DOI : 10.1016/0304-3975(95)00188-3

URL : http://arxiv.org/abs/1006.1405

L. Brim, J. Chaloupka, L. Doyen, R. Gentilini, and J. F. Raskin, Faster algorithms for mean-payoff games, Formal Methods in System Design, vol.158, issue.24, pp.97-118, 2011.
DOI : 10.1016/0304-3975(95)00188-3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. J. Chinn and G. R. Madey, Temporal representation and reasoning for workflow in engineering design change review, IEEE Transactions on Engineering Management, vol.47, issue.4, pp.485-492, 2000.
DOI : 10.1109/17.895343

C. Combi, M. Gambini, S. Migliorini, and R. Posenato, Modelling temporal, data-centric medical processes, Proceedings of the 2nd ACM SIGHIT symposium on International health informatics, IHI '12, pp.141-150, 2012.
DOI : 10.1145/2110363.2110382

C. Combi, M. Gambini, S. Migliorini, and R. Posenato, Representing business processes through a temporal data-centric workflow modeling language: An application to the management of clinical pathways. Systems, Man, and Cybernetics: Systems, IEEE Transactions on, vol.44, issue.9, pp.1182-12032300055, 2014.

C. Combi, M. Gozzi, R. Posenato, and G. Pozzi, Conceptual modeling of flexible temporal workflows, ACM Transactions on Autonomous and Adaptive Systems, vol.7, issue.2, pp.1-1929, 2012.
DOI : 10.1145/2240166.2240169

C. Combi and R. Posenato, Controllability in Temporal Conceptual Workflow Schemata, BPM 2009 -Proc. of the 7th Business Process Management Conference, pp.64-79, 2009.
DOI : 10.1007/978-3-540-25975-6_12

C. Combi and G. Pozzi, Architectures for a temporal workflow management system, Proceedings of the 2004 ACM symposium on Applied computing , SAC '04, pp.659-666, 2004.
DOI : 10.1145/967900.968040

C. Comin, A HyTN Consistency Check Algorithm Implementation in C++, 2015.

C. Comin, R. Posenato, and R. Rizzi, A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games, 2014 21st International Symposium on Temporal Representation and Reasoning, pp.7-16, 2014.
DOI : 10.1109/TIME.2014.19

URL : https://hal.archives-ouvertes.fr/hal-01577455

C. Comin and R. Rizzi, Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking, 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), pp.19-28, 2015.
DOI : 10.1109/TIME.2015.18

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

R. Dechter, I. Meiri, and J. Pearl, Temporal constraint networks, Artificial Intelligence, vol.4913, issue.91, pp.61-95, 1991.
DOI : 10.1016/b978-155860890-0/50013-x

J. Eder, W. Gruber, and E. Panagos, Temporal Modeling of Workflows with Conditional Execution Paths, Database and Expert Systems Applications, pp.243-253, 2000.
DOI : 10.1007/3-540-44469-6_23

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Eder, E. Panagos, and M. Rabinovich, Time constraints in workflow systems, Advanced Information Systems Engineering, pp.286-300, 1999.
DOI : 10.1007/3-540-48738-7_22

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Ehrenfeucht and J. Mycielski, Positional strategies for mean payoff games, International Journal of Game Theory, vol.59, issue.2, pp.109-113, 1979.
DOI : 10.1007/BF01768705

P. M. Gonzalez-del-foyo, R. Silva, and J. , Using time Petri Nets for modeling and verification of timed constrained workflow systems, ABCM Symposium Series in Mechatronics, pp.471-478, 2008.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

D. Hollingsworth, The workflow reference model, 1995.

L. Hunsberger, R. Posenato, and C. Combi, A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks, 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), pp.4-18, 2015.
DOI : 10.1109/TIME.2015.26

M. Jurdzi?ski, Deciding the winner in parity games is in UP ??? co-UP, Information Processing Letters, vol.68, issue.3, pp.119-124, 1998.
DOI : 10.1016/S0020-0190(98)00150-1

L. Khatib, P. Morris, R. Morris, and F. Rossi, Temporal constraint reasoning with preferences, Proceedings of the 17th International Joint Conference on Artificial Intelligence, pp.322-327, 2001.

L. Khatib, P. Morris, R. Morris, F. Rossi, A. Sperduti et al., Solving and learning a tractable class of soft temporal constraints: Theoretical and experimental results, AI Communications, vol.20, issue.3, pp.181-209, 2007.

M. Koubarakis, From local to global consistency in temporal constraint networks, Theoretical Computer Science, vol.173, issue.1, pp.89-112, 1997.
DOI : 10.1016/S0304-3975(96)00192-2

A. Lanz and M. Reichert, Enabling time-aware process support with the atapis toolset, Proceedings of the BPM Demo Sessions 2014, CEUR Workshop Proceedings, pp.41-45, 2014.

A. Lanz, B. Weber, and M. Reichert, Time patterns for process-aware information systems, Requirements Engineering, vol.55, issue.3, pp.113-141, 2012.
DOI : 10.1016/S0164-1212(00)00073-X

URL : http://dbis.eprints.uni-ulm.de/854/1/LaWR13%20%5BREJ%5D%20TimePatterns.pdf

Y. Lifshits and D. Pavlov, Potential theory for mean payoff games, Journal of Mathematical Sciences, vol.158, issue.3, pp.4967-4974, 2007.
DOI : 10.1145/321992.321993

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Mendling, H. A. Reijers, and W. M. Van-der-aalst, Seven process modeling guidelines (7PMG) Information and Software Technology, pp.127-136, 2010.
DOI : 10.1016/j.infsof.2009.08.004

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

P. Merlin and D. J. Farber, Recoverability of Communication Protocols--Implications of a Theoretical Study, IEEE Transactions on Communications, vol.24, issue.9, pp.1036-10431093424, 1976.
DOI : 10.1109/TCOM.1976.1093424

P. Morris, N. Muscettola, and T. Vidal, Dynamic control of plans with temporal uncertainty, Proceedings of the 17th International Joint Conference on Artificial Intelligence, pp.494-499, 2001.

A. Pani and G. Bhattacharjee, Temporal representation and reasoning in artificial intelligence: A review, Mathematical and Computer Modelling, vol.34, issue.1-2, pp.55-80, 2001.
DOI : 10.1016/S0895-7177(01)00049-8

URL : http://doi.org/10.1016/s0895-7177(01)00049-8

C. H. Papadimitriou, Computational Complexity pgsolver: The pgsolver collection of parity game solvers, 1994.

S. Kumar and T. K. , On the tractability of restricted disjunctive temporal problems, ICAPS 2005 -Proceedings of the 15th International Conference on Automated Planning and Scheduling, pp.110-119, 2005.

S. Schewe, An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games, Computer Science Logic, pp.369-384978, 2008.
DOI : 10.1007/978-3-540-87531-4_27

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Schewe, A. Trivedi, and T. Varghese, Symmetric Strategy Improvement, Automata, Languages, and Programming -42nd International Colloquium, ICALP 2015 Proceedings , Part II, pp.388-400978, 2015.
DOI : 10.1007/978-3-662-47666-6_31

URL : http://arxiv.org/abs/1501.06484

D. Smith, J. Frank, and A. Jónsson, Bridging the gap between planning and scheduling, The Knowledge Engineering Review, vol.15, issue.1, pp.47-83, 2000.
DOI : 10.1017/S0269888900001089

K. Stergiou and M. Koubarakis, Backtracking algorithms for disjunctions of temporal constraints, Artificial Intelligence, vol.120, issue.1, pp.81-117, 2000.
DOI : 10.1016/S0004-3702(00)00019-9

I. Tsamardinos, T. Vidal, and M. E. Pollack, Ctp: A new constraint-based formalism for conditional, temporal planning, Constraints, vol.8, issue.4, pp.365-388, 1023.
DOI : 10.1023/A:1025894003623

T. Vidal and H. Fargier, Handling contingency in temporal constraint networks: from consistency to controllabilities, Journal of Experimental & Theoretical Artificial Intelligence, vol.6, issue.1, pp.23-45, 1999.
DOI : 10.1016/0933-3657(91)90004-U

U. Zwick and M. Paterson, The complexity of mean payoff games on graphs, Theoretical Computer Science, vol.158, issue.1-2, pp.343-359, 1996.
DOI : 10.1016/0304-3975(95)00188-3