{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:03:08Z","timestamp":1762459388880,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T00:00:00Z","timestamp":1458691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10601-016-9243-0","type":"journal-article","created":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T05:47:29Z","timestamp":1458712049000},"page":"152-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hyper temporal networks"],"prefix":"10.1007","volume":"22","author":[{"given":"Carlo","family":"Comin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0944-0419","authenticated-orcid":false,"given":"Roberto","family":"Posenato","sequence":"additional","affiliation":[]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,23]]},"reference":[{"issue":"1","key":"9243_CR1","first-page":"5","volume":"14","author":"W van der Aalst","year":"2003","unstructured":"van der Aalst, W., ter Hofstede, A., Kiepuszewski, B., & Barros, A. (2003). Workflow patterns. Distributed and Parallel Databases, 14(1), 5\u201351. doi: 10.1023\/A:1022883727209 .","journal-title":"Distributed and Parallel Databases"},{"key":"9243_CR2","first-page":"641","volume-title":"Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference","author":"R Bart\u00e1k","year":"2007","unstructured":"Bart\u00e1k, R., & \u010cepek, O. (2007). Temporal networks with alternatives: Complexity and model. In Wilson, D., & Sutcliffe, G. (Eds.), Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference (pp. 641\u2013646). Key West: AAAI Press."},{"issue":"1","key":"9243_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87\u201390.","journal-title":"Quarterly of Applied Mathematics"},{"key":"9243_CR4","unstructured":"Bettini, C., Wang, X.S., & Jajodia, S. (2002). Temporal reasoning in workflow systems, (Vol. 11."},{"issue":"2","key":"9243_CR5","first-page":"210","volume":"155","author":"H Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, H., & Vorobyov, S. (2007). A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Applied Mathematics, 155(2), 210\u2013229. doi: 10.1016\/j.dam.2006.04.029 .","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"9243_CR6","first-page":"585","volume":"23","author":"L Brim","year":"2012","unstructured":"Brim, L., & Chaloupka, J. (2012). Using strategy improvement to stay alive. International Journal of Foundations of Computer Science, 23(3), 585\u2013608. doi: 10.1142\/S0129054112400291 .","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"9243_CR7","first-page":"97","volume":"38","author":"L Brim","year":"2011","unstructured":"Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., & Raskin, J. F. (2011). Faster algorithms for mean-payoff games. Formal Methods in System Design, 38(2), 97\u2013118. doi: 10.1007\/s10703-010-0105-x .","journal-title":"Formal Methods in System Design"},{"issue":"4","key":"9243_CR8","first-page":"485","volume":"47","author":"SJ Chinn","year":"2000","unstructured":"Chinn, S. J., & Madey, G. R. (2000). Temporal representation and reasoning for workflow in engineering design change review. IEEE Transactions on Engineering Management, 47(4), 485\u2013492. doi: 10.1109\/17.895343 .","journal-title":"IEEE Transactions on Engineering Management"},{"key":"9243_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/2110363.2110382","volume-title":"Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium, IHI \u201912","author":"C Combi","year":"2012","unstructured":"Combi, C., Gambini, M., Migliorini, S., & Posenato, R. (2012). Modelling temporal, data-centric medical processes. In Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium, IHI \u201912 (pp. 141\u2013150). New York: ACM. doi: 10.1145\/2110363.2110382 ."},{"issue":"9","key":"9243_CR10","first-page":"1182","volume":"44","author":"C Combi","year":"2014","unstructured":"Combi, C., Gambini, M., Migliorini, S., & Posenato, R. (2014). Representing business processes through a temporal data-centric workflow modeling language: An application to the management of clinical pathways. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 44(9), 1182\u20131203. doi: 10.1109\/TSMC.2014.2300055 .","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"2","key":"9243_CR11","first-page":"19:1","volume":"7","author":"C Combi","year":"2012","unstructured":"Combi, C., Gozzi, M., Posenato, R., & Pozzi, G. (2012). Conceptual modeling of flexible temporal workflows. ACM Transactions Autonomous Adaptive Systems, 7 (2), 19:1\u201319:29. doi: 10.1145\/2240166.2240169 .","journal-title":"ACM Transactions Autonomous Adaptive Systems"},{"key":"9243_CR12","doi-asserted-by":"publisher","unstructured":"Combi, C., & Posenato, R. (2009). Controllability in temporal conceptual workflow schemata. In BPM 2009 - Proceedings of the 7th Business Process Management Conference (pp. 64\u201379). doi: 10.1007\/978-3-642-03848-8_6 .","DOI":"10.1007\/978-3-642-03848-8_6"},{"key":"9243_CR13","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1145\/967900.968040","volume-title":"Proceedings of the 2004 ACM symp. on applied computing, SAC \u201904","author":"C Combi","year":"2004","unstructured":"Combi, C., & Pozzi, G. (2004). Architectures for a temporal workflow management system. In Proceedings of the 2004 ACM symp. on applied computing, SAC \u201904 (pp. 659\u2013666). New York: ACM, DOI 10.1145\/967900.968040 ."},{"key":"9243_CR14","unstructured":"Comin, C. (2015). A HyTN Consistency Check Algorithm Implementation in C++. http:\/\/profs.scienze.univr.it\/posenato\/software\/hytn\/2015_v1_Code.tgz ."},{"key":"9243_CR15","doi-asserted-by":"publisher","unstructured":"Comin, C., Posenato, R., & Rizzi, R. (2014). A tractable generalization of simple temporal networks and its relation to mean payoff games. In 21St international symposium on temporal representation and reasoning (TIME 2014) (pp. 7\u201316): IEEE CPS. doi: 10.1109\/TIME.2014.19 .","DOI":"10.1109\/TIME.2014.19"},{"key":"9243_CR16","doi-asserted-by":"publisher","unstructured":"Comin, C., & Rizzi, R. (2015). Dynamic consistency of conditional simple temporal networks via mean payoff games: a singly-exponential time DC-checking. In 22Nd international symposium on temporal representation and reasoning (TIME 2015) (pp. 19\u201328): IEEE CPS. doi: 10.1109\/TIME.2015.18 .","DOI":"10.1109\/TIME.2015.18"},{"key":"9243_CR17","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., & Stein, C. (2001). Introduction to algorithms the MIT press."},{"issue":"1\u20133","key":"9243_CR18","first-page":"61","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49(1\u20133), 61\u201395. doi: 10.1016\/0004-3702(91)90006-6 .","journal-title":"Artificial Intelligence"},{"key":"9243_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44469-6_23","volume-title":"Database and expert systems applications (DEXA 2000), LNCS","author":"J Eder","year":"2000","unstructured":"Eder, J., Gruber, W., & Panagos, E. (2000). Temporal modeling of workflows with conditional execution paths. In Ibrahim, M., K\u00fcng, J., & Revell, N. (Eds.), Database and expert systems applications (DEXA 2000), LNCS, (Vol. 1873 pp. 243\u2013253). Berlin: Springer. doi: 10.1007\/3-540-44469-6_23 ."},{"key":"9243_CR20","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-48738-7_22","volume-title":"Advanced Information Systems Engineering, LNCS","author":"J Eder","year":"1999","unstructured":"Eder, J., Panagos, E., & Rabinovich, M. (1999). Time constraints in workflow systems. In Jarke, M., & Oberweis, A. (Eds.), Advanced Information Systems Engineering, LNCS, (Vol. 1626 pp. 286\u2013300). Berlin: Springer. doi: 10.1007\/3-540-48738-7_22 ."},{"issue":"2","key":"9243_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., & Mycielski, J. (1979). Positional strategies for mean payoff games. International Journal of Game Theory, 8(2), 109\u2013113. doi: 10.1007\/BF01768705","journal-title":"International Journal of Game Theory"},{"key":"9243_CR22","unstructured":"Ford Jr., L. R., & Fulkerson, D. R. (1962). Flows in networks Vol. 3: Princeton University Press."},{"key":"9243_CR23","unstructured":"Gonzalez del Foyo, P. M., & Reinaldo Silva, J. (2008). Using time Petri Nets for modeling and verification of timed constrained workflow systems, ABCM Symposium series in mechatronics (pp. 471\u2013478). Brazil: Dept. Of Mechatronics, University of S\u00e3o Paulo."},{"key":"9243_CR24","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman."},{"key":"9243_CR25","unstructured":"Hollingsworth, D. (1995). The workflow reference model. http:\/\/www.wfmc.org\/standards\/model.htm ."},{"key":"9243_CR26","doi-asserted-by":"publisher","unstructured":"Hunsberger, L., Posenato, R., & Combi, C. (2015). A sound-and-complete propagation-based algorithm for checking the dynamic consistency of conditional simple temporal networks. In Grandi, F., Lange, M., & Lomuscio, A. (Eds.), 22st International Symposium on Temporal Representation and Reasoning (TIME 2015) (pp. 4\u201318). IEEE CPS. doi: 10.1109\/TIME.2015.26 .","DOI":"10.1109\/TIME.2015.26"},{"issue":"3","key":"9243_CR27","first-page":"119","volume":"68","author":"M Jurdzi\u0144ski","year":"1998","unstructured":"Jurdzi\u0144ski, M. (1998). Deciding the winner in parity games is in UP \u2229 $\\cap $ co-UP. Information Processing Letters, 68(3), 119\u2013124. doi: 10.1016\/S0020-0190(98)00150-1 .","journal-title":"Information Processing Letters"},{"key":"9243_CR28","first-page":"322","volume-title":"Proceedings of the 17th international joint conference on artificial intelligence - volume 1, IJCAI$^{\\prime }$\u203201","author":"L Khatib","year":"2001","unstructured":"Khatib, L., Morris, P., Morris, R., & Rossi, F. (2001). Temporal constraint reasoning with preferences, Proceedings of the 17th international joint conference on artificial intelligence - volume 1, IJCAI \u2032 $^{\\prime }$ 01 (pp. 322\u2013327). San Francisco: Morgan Kaufmann."},{"issue":"3","key":"9243_CR29","first-page":"181","volume":"20","author":"L Khatib","year":"2007","unstructured":"Khatib, L., Morris, P., Morris, R., Rossi, F., Sperduti, A., & Venable, K.B. (2007). Solving and learning a tractable class of soft temporal constraints: Theoretical and experimental results. AI Communications, 20(3), 181\u2013209.","journal-title":"AI Communications"},{"issue":"1","key":"9243_CR30","first-page":"89","volume":"173","author":"M Koubarakis","year":"1997","unstructured":"Koubarakis, M. (1997). From local to global consistency in temporal constraint networks. Theoretical Computer Science, 173(1), 89\u2013112. doi: 10.1016\/S0304-3975(96)00192-2 .","journal-title":"Theoretical Computer Science"},{"key":"9243_CR31","unstructured":"Lanz, A., & Reichert, M. (2014). Enabling time-aware process support with the atapis toolset. In Limonad, L., & Weber, B. (Eds.), Proceedings of the BPM Demo Sessions 2014, CEUR Workshop Proceedings, (Vol. 1295 pp. 41\u201345): CEUR."},{"issue":"2","key":"9243_CR32","first-page":"113","volume":"19","author":"A Lanz","year":"2012","unstructured":"Lanz, A., Weber, B., & Reichert, M. (2012). Time patterns for process-aware information systems. Requirements Engineering, 19(2), 113\u2013141. doi: 10.1007\/s00766-012-0162-3 .","journal-title":"Requirements Engineering"},{"issue":"3","key":"9243_CR33","first-page":"4967","volume":"145","author":"Y Lifshits","year":"2007","unstructured":"Lifshits, Y., & Pavlov, D. (2007). Potential theory for mean payoff games. Journal of Mathematical Sciences, 145(3), 4967\u20134974. doi: 10.1007\/s10958-007-0331-y .","journal-title":"Journal of Mathematical Sciences"},{"issue":"2","key":"9243_CR34","first-page":"127","volume":"52","author":"J Mendling","year":"2010","unstructured":"Mendling, J., Reijers, H. A., & van der Aalst, W. M. P. (2010). Seven process modeling guidelines (7PMG). Information and Software Technology, 52(2), 127\u2013136. doi: 10.1016\/j.infsof.2009.08.004 .","journal-title":"Information and Software Technology"},{"issue":"9","key":"9243_CR35","first-page":"1036","volume":"24","author":"P Merlin","year":"1976","unstructured":"Merlin, P., & Farber, D. J. (1976). Recoverability of communication protocols\u2013implications of a theoretical study. IEEE Transactions on Communications, 24(9), 1036\u20131043. doi: 10.1109\/TCOM.1976.1093424 .","journal-title":"IEEE Transactions on Communications"},{"key":"9243_CR36","first-page":"494","volume-title":"Proceedings of the 17th international joint conference on artificial intelligence - volume 1, IJCAI\u201901","author":"P Morris","year":"2001","unstructured":"Morris, P., Muscettola, N., & Vidal, T. (2001). Dynamic control of plans with temporal uncertainty. In Proceedings of the 17th international joint conference on artificial intelligence - volume 1, IJCAI\u201901 (pp. 494\u2013499). San Francisco: Morgan Kaufmann."},{"issue":"1-2","key":"9243_CR37","first-page":"55","volume":"34","author":"A Pani","year":"2001","unstructured":"Pani, A., & Bhattacharjee, G. (2001). Temporal representation and reasoning in artificial intelligence: A review. Mathematical and Computer Modelling, 34(1-2), 55\u201380. doi: 10.1016\/S0895-7177(01)00049-8 .","journal-title":"Mathematical and Computer Modelling"},{"key":"9243_CR38","unstructured":"Papadimitriou, C. H. (1994). Computational complexity, Addison-Wesley."},{"key":"9243_CR39","unstructured":"pgsolver: The pgsolver collection of parity game solvers. https:\/\/github.com\/tcsprojects\/pgsolver (2013)."},{"key":"9243_CR40","unstructured":"Satish Kumar, T. K. (2005). On the tractability of restricted disjunctive temporal problems. In ICAPS 2005 - Proceedings of the 15th international conference on automated planning and scheduling (pp. 110\u2013119)."},{"key":"9243_CR41","doi-asserted-by":"publisher","unstructured":"Schewe, S. (2008). An optimal strategy improvement algorithm for solving parity and payoff games. In Kaminski, M., & Martini, S. (Eds.), Computer science logic, LNCS, (Vol. 5213 pp. 369\u2013384). Springer. doi: 10.1007\/978-3-540-87531-4_27 .","DOI":"10.1007\/978-3-540-87531-4_27"},{"key":"9243_CR42","doi-asserted-by":"publisher","unstructured":"Schewe, S., Trivedi, A., & Varghese, T. (2015). Symmetric strategy improvement. In Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., & Speckmann, B. (Eds.), Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Lecture Notes in Computer Science, (Vol. 9135 pp. 388\u2013400). Springer. doi: 10.1007\/ 978-3-662-47666-6_31 .","DOI":"10.1007\/978-3-662-47666-6_31"},{"issue":"1","key":"9243_CR43","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1017\/S0269888900001089","volume":"15","author":"D Smith","year":"2000","unstructured":"Smith, D., Frank, J., & J\u00f3nsson, A. (2000). Bridging the gap between planning and scheduling. Knowledge Engineering Review, 15(1), 47\u201383. doi: 10.1017\/S0269888900001089","journal-title":"Knowledge Engineering Review"},{"issue":"1","key":"9243_CR44","first-page":"81","volume":"120","author":"K Stergiou","year":"2000","unstructured":"Stergiou, K., & Koubarakis, M. (2000). Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence, 120(1), 81\u2013117. doi: 10.1016\/S0004-3702(00)00019-9 .","journal-title":"Artificial Intelligence"},{"issue":"4","key":"9243_CR45","first-page":"365","volume":"8","author":"I Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., Vidal, T., & Pollack, M. E. (2003). Ctp: A new constraint-based formalism for conditional, temporal planning. Constraints, 8(4), 365\u2013388. doi: 10.1023\/A:1025894003623 .","journal-title":"Constraints"},{"issue":"1","key":"9243_CR46","first-page":"23","volume":"11","author":"T Vidal","year":"1999","unstructured":"Vidal, T., & Fargier, H. (1999). Handling contingency in temporal constraint networks: from consistency to controllabilities. Journal of Experimental and Theoretical Artificial Intelligence, 11(1), 23\u201345. doi: 10.1080\/095281399146607 .","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"issue":"1\u20132","key":"9243_CR47","first-page":"343","volume":"158","author":"U Zwick","year":"1996","unstructured":"Zwick, U., & Paterson, M. (1996). The complexity of mean payoff games on graphs. Theoretical Computer Science, 158(1\u20132), 343\u2013359. doi: 10.1016\/0304-3975(95)00188-3 .","journal-title":"Theoretical Computer Science"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-016-9243-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9243-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9243-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9243-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:14:19Z","timestamp":1559229259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-016-9243-0"}},"subtitle":["A tractable generalization of simple temporal networks and its relation to mean payoff games"],"short-title":[],"issued":{"date-parts":[[2016,3,23]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9243"],"URL":"https:\/\/doi.org\/10.1007\/s10601-016-9243-0","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2016,3,23]]}}}