{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T19:47:02Z","timestamp":1765828022572,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007052","name":"Universit\u00e0 degli Studi di Verona","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007052","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Data Semant"],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A current research problem in the area of business process management deals with the specification and checking of constraints on resources (e.g., users, agents, autonomous systems, etc.) allowed to be committed for the execution of specific tasks. Indeed, in many real-world situations, role assignments are not enough to assign tasks to the suitable resources. It could be the case that further requirements need to be specified and satisfied. As an example, one would like to avoid that employees that are relatives are assigned to a set of critical tasks in the same process in order to prevent fraud. The formal specification of a business process and its related access control constraints is obtained through a decoration of a classic business process with roles, users, and constraints on their commitment. As a result, such a process specifies a set of tasks that need to be executed by authorized users with respect to some partial order in a way that all authorization constraints are satisfied. Controllability refers in this case to the capability of executing the process satisfying all these constraints, even when some process components, e.g., gateway conditions, can only be observed, but not decided, by the process engine responsible of the execution. In this paper, we propose<jats:italic>conditional constraint networks with decisions (CCNDs)<\/jats:italic>as a model to encode business processes that involve access control and conditional branches that may be both controllable and uncontrollable. We define weak, strong, and dynamic controllability of CCNDs as two-player games, classify their computational complexity, and discuss strategy synthesis algorithms. We provide an encoding from the business processes we consider here into CCNDs to exploit off-the-shelf their strategy synthesis algorithms. We introduce<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsc {Zeta}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>Z<\/mml:mi><mml:mstyle><mml:mi>E<\/mml:mi><mml:mi>T<\/mml:mi><mml:mi>A<\/mml:mi><\/mml:mstyle><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>, a tool for checking controllability of CCNDs, synthesizing execution strategies, and executing controllable CCNDs, by also supporting user interactivity. We use<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsc {Zeta}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>Z<\/mml:mi><mml:mstyle><mml:mi>E<\/mml:mi><mml:mi>T<\/mml:mi><mml:mi>A<\/mml:mi><\/mml:mstyle><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>to compare with the previous research, provide a new experimental evaluation for CCNDs, and discuss limitations.<\/jats:p>","DOI":"10.1007\/s13740-021-00119-w","type":"journal-article","created":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T17:03:01Z","timestamp":1614963781000},"page":"19-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Resource Controllability of Business Processes Under Conditional Uncertainty"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6696-2972","authenticated-orcid":false,"given":"Matteo","family":"Zavatteri","sequence":"first","affiliation":[]},{"given":"Carlo","family":"Combi","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Vigan\u00f2","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"issue":"1","key":"119_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0004-3702(01)00162-X","volume":"135","author":"J Amilhastre","year":"2002","unstructured":"Amilhastre J, Fargier H, Marquis P (2002) Consistency restoration and explanations in dynamic csps application to configuration. Artif Intell 135(1):199\u2013234","journal-title":"Artif Intell"},{"issue":"3","key":"119_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/501978.501979","volume":"4","author":"E Bertino","year":"2001","unstructured":"Bertino E, Bonatti PA, Ferrari E (2001) TRBAC: a temporal role-based access control model. ACM Trans Inf Syst Secur 4(3):191\u2013233","journal-title":"ACM Trans Inf Syst Secur"},{"key":"119_CR3","unstructured":"Business process modeling notation 2.0. http:\/\/www.omg.org\/spec\/BPMN\/2.0\/"},{"key":"119_CR4","doi-asserted-by":"crossref","unstructured":"Brucker AD (2014) Using securebpmn for modelling security-aware service compositions. In: Secure and trustworthy service composition, lecture notes in computer science, vol 8900. Springer, pp 110\u2013120","DOI":"10.1007\/978-3-319-13518-2_8"},{"key":"119_CR5","doi-asserted-by":"crossref","unstructured":"Brucker AD, Hang I, L\u00fcckemeyer G, Ruparel R (2012) SecureBPMN: modeling and enforcing access control requirements in business processes. In: SACMAT. ACM, pp 123\u2013126","DOI":"10.1145\/2295136.2295160"},{"key":"119_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.is.2015.03.002","volume":"52","author":"C Cabanillas","year":"2015","unstructured":"Cabanillas C, Resinas M, del-R\u00edo-Ortega A, Cort\u00e9s AR (2015) Specification and automated design-time analysis of the business process human resource perspective. Inf Syst 52:55\u201382. https:\/\/doi.org\/10.1016\/j.is.2015.03.002","journal-title":"Inf Syst"},{"key":"119_CR7","doi-asserted-by":"publisher","unstructured":"Cairo M, Combi C, Comin C, Hunsberger L, Posenato R, Rizzi R, Zavatteri M (2017) Incorporating decision nodes into conditional simple temporal networks. In: TIME 2017, vol.\u00a090. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp 9:1\u20139:17. https:\/\/doi.org\/10.4230\/LIPIcs.TIME.2017.9","DOI":"10.4230\/LIPIcs.TIME.2017.9"},{"issue":"9","key":"119_CR8","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1109\/TSMC.2014.2300055","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 Trans Syst Man Cybern Syst 44(9):1182\u20131203. https:\/\/doi.org\/10.1109\/TSMC.2014.2300055","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"119_CR9","doi-asserted-by":"crossref","unstructured":"Combi C, Posenato R (2009) Controllability in temporal conceptual workflow schemata. In: BPM. Springer, pp 64\u201379","DOI":"10.1007\/978-3-642-03848-8_6"},{"key":"119_CR10","doi-asserted-by":"publisher","unstructured":"Combi C, Posenato R, Vigan\u00f2 L, Zavatteri M (2017) Access controlled temporal networks. In: ICAART 2017. ScitePress. https:\/\/doi.org\/10.5220\/0006185701180131","DOI":"10.5220\/0006185701180131"},{"key":"119_CR11","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1613\/jair.1.11453","volume":"64","author":"C Combi","year":"2019","unstructured":"Combi C, Posenato R, Vigan\u00f2 L, Zavatteri M (2019) Conditional simple temporal networks with uncertainty and resources. J Artif Intell Res 64:931\u2013985. https:\/\/doi.org\/10.1613\/jair.1.11453","journal-title":"J Artif Intell Res"},{"key":"119_CR12","doi-asserted-by":"publisher","unstructured":"Combi C, Vigan\u00f2 L, Zavatteri M (2016) Security constraints in temporal role-based access-controlled workflows. In: CODASPY 2016. ACM. https:\/\/doi.org\/10.1145\/2857705.2857716","DOI":"10.1145\/2857705.2857716"},{"key":"119_CR13","unstructured":"Corradini F, Fornari F, Polini A, Re B, Tiezzi F (2019) Reprository: a repository platform for sharing business process models. In: Depaire B, Smedt JD, Dumas M, Fahland D, Kumar A, Leopold H, Reichert M, Rinderle-Ma S, Schulte S, Seidel S, van\u00a0der Aalst WMP (eds) Proceedings of the dissertation award, doctoral consortium, and demonstration track at BPM 2019 co-located with 17th international conference on business process management, BPM 2019, Vienna, Austria, September 1-6, 2019, CEUR Workshop Proceedings, vol 2420, pp 149\u2013153. CEUR-WS.org. http:\/\/ceur-ws.org\/Vol-2420\/paperDT7.pdf"},{"key":"119_CR14","volume-title":"Constraint processing","author":"R Dechter","year":"2003","unstructured":"Dechter R (2003) Constraint processing. Elsevier, Amsterdam"},{"key":"119_CR15","unstructured":"Dechter R, Dechter A (1988) Belief maintenance in dynamic constraint networks. In: 7th AAAI national conference on artificial intelligence, AAAI\u201988. AAAI Press, pp 37\u201342 (1988)"},{"issue":"1\u20133","key":"119_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter R, Meiri I, Pearl J (1991) Temporal constraint networks. Artif Intell 49(1\u20133):61\u201395","journal-title":"Artif Intell"},{"key":"119_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90002-6","author":"R Dechter","year":"1987","unstructured":"Dechter R, Pearl J (1987) Network-based heuristics for constraint-satisfaction problems. Artif Int. https:\/\/doi.org\/10.1016\/0004-3702(87)90002-6","journal-title":"Artif Int"},{"key":"119_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56509-4","volume-title":"Fundamentals of business process management","author":"M Dumas","year":"2018","unstructured":"Dumas M, Rosa ML, Mendling J, Reijers HA (2018) Fundamentals of business process management. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-662-56509-4"},{"key":"119_CR19","doi-asserted-by":"publisher","unstructured":"Eder J, Franceschetti M, K\u00f6pke J (2018) Controllability of orchestrations with temporal SLA: encoding temporal XOR in CSTNUD. In: iiWAS 2018. ACM , pp 234\u20132422018). https:\/\/doi.org\/10.1145\/3282373.3282398","DOI":"10.1145\/3282373.3282398"},{"key":"119_CR20","doi-asserted-by":"crossref","unstructured":"Fargier, H., Lang, J.: Uncertainty in constraint satisfaction problems: a probabilistic approach. In: Symbolic and quantitative approaches to reasoning and uncertainty, pp 97\u2013104. Springer (1993)","DOI":"10.1007\/BFb0028188"},{"key":"119_CR21","unstructured":"Fargier H, Lang J, Martin-Clouaire R, Schiex T (1995) A constraint satisfaction framework for decision under uncertainty. In: 11th annual conference on uncertainty in artificial intelligence (UAI \u201995), pp 167\u2013174. Morgan Kaufmann Publishers Inc"},{"key":"119_CR22","unstructured":"Fargier, H., Lang, J., Schiex, T.: Mixed Constraint Satisfaction: A Framework for Decision Problems Under Incomplete Knowledge. In: 13th National Conference on Artificial Intelligence - Volume 1, AAAI\u201996, pp. 175\u2013180. AAAI Press (1996)"},{"key":"119_CR23","unstructured":"Franceschetti M, Eder J (2019) Towards checking dynamic controllability of processes with temporal loops. pp 1\u201314"},{"issue":"11","key":"119_CR24","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1145\/359642.359654","volume":"21","author":"EC Freuder","year":"1978","unstructured":"Freuder EC (1978) Synthesizing constraint expressions. Commun ACM 21(11):958\u2013966","journal-title":"Commun ACM"},{"key":"119_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"EC Freuder","year":"1982","unstructured":"Freuder EC (1982) A sufficient condition for backtrack-free search. J ACM 29:24\u201332","journal-title":"J ACM"},{"key":"119_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.07.006","author":"G Gottlob","year":"2012","unstructured":"Gottlob G (2012) On minimal constraint networks. Artif Intell. https:\/\/doi.org\/10.1016\/j.artint.2012.07.006","journal-title":"Artif Intell"},{"key":"119_CR27","unstructured":"Hunsberger L, Posenato R, Combi C (2012) The dynamic controllability of conditional STNs with uncertainty. In: PlanEx at ICAPS-2012. arXiv:1212.2005"},{"key":"119_CR28","doi-asserted-by":"crossref","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: 22nd international symposium on temporal representation and reasoning (TIME 2015), pp 4\u201318. IEEE Computer Society","DOI":"10.1109\/TIME.2015.26"},{"issue":"1","key":"119_CR29","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth AK (1977) Consistency in networks of relations. Artif Intell 8(1):99\u2013118","journal-title":"Artif Intell"},{"issue":"1","key":"119_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2298\/CSIS160628037M","volume":"15","author":"G Milosavljevic","year":"2018","unstructured":"Milosavljevic G, Sladic G, Milosavljevic B, Zaric M, Gostojic S, Slivka J (2018) Context-sensitive constraints for access control of business processes. Comput Sci Inf Syst 15(1):1\u201330","journal-title":"Comput Sci Inf Syst"},{"key":"119_CR31","unstructured":"Mittal S, Falkenhainer B (1990) Dynamic constraint satisfaction problems. In: 8th national conference on artificial intelligence, AAAI\u201990, pp 25\u201332. AAAI Press"},{"issue":"2","key":"119_CR32","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R Mohr","year":"1986","unstructured":"Mohr R, Henderson TC (1986) Arc and path consistency revisited. Artif Intell 28(2):225\u2013233","journal-title":"Artif Intell"},{"key":"119_CR33","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U Montanari","year":"1974","unstructured":"Montanari U (1974) Networks of constraints: fundamental properties and applications to picture processing. Sci Inf 7:95\u2013132","journal-title":"Sci Inf"},{"key":"119_CR34","first-page":"494","volume":"2001","author":"PH Morris","year":"2001","unstructured":"Morris PH, Muscettola N, Vidal T (2001) Dynamic control of plans with temporal uncertainty. IJCAI 2001:494\u2013502","journal-title":"IJCAI"},{"key":"119_CR35","doi-asserted-by":"crossref","unstructured":"de\u00a0Moura L, Bj\u00f8rner N (2008) Z3: an efficient smt solver. In: Tools and algorithms for the construction and analysis of systems, pp 337\u2013340. Springer","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"119_CR36","unstructured":"Nouioua M, Zouari B, Alti A (2019) Formal approach for authorization in distributed business process related task document role based access control. In: IWCMC, pp 1964\u20131970. IEEE"},{"key":"119_CR37","doi-asserted-by":"publisher","unstructured":"Posenato R, Zerbato F, Combi C (2018) Managing decision tasks and events in time-aware business process models. In: BPM 2018, LNCS, vol 11080, pp 102\u2013118. Springer. https:\/\/doi.org\/10.1007\/978-3-319-98648-7_7","DOI":"10.1007\/978-3-319-98648-7_7"},{"issue":"5","key":"119_CR38","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/s10270-020-00781-x","volume":"19","author":"Q Ramadan","year":"2020","unstructured":"Ramadan Q, Str\u00fcber D, Salnitri M, J\u00fcrjens J, Riediger V, Staab S (2020) A semi-automated bpmn-based framework for detecting conflicts between security, data-minimization, and fairness requirements. Softw Syst Model 19(5):1191\u20131227","journal-title":"Softw Syst Model"},{"key":"119_CR39","doi-asserted-by":"crossref","unstructured":"Rosa ML, Dumas M, ter Hofstede AHM, Mendling J, Gottschalk F (2008) Beyond control-flow: extending business process configuration to roles and objects. In: ER, Lecture Notes in Computer Science, vol 5231, pp 199\u2013215. Springer","DOI":"10.1007\/978-3-540-87877-3_16"},{"key":"119_CR40","unstructured":"Sabin M, Freuder EC (1999) Detecting and resolving inconsistency and redundancy in conditional constraint satisfaction problems. AAAI Technical Report"},{"issue":"2","key":"119_CR41","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/2.485845","volume":"29","author":"RS Sandhu","year":"1996","unstructured":"Sandhu RS, Coyne EJ, Feinstein HL, Youman CE (1996) Role-based access control models. Computer 29(2):38\u201347. https:\/\/doi.org\/10.1109\/2.485845","journal-title":"Computer"},{"issue":"5","key":"119_CR42","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1504\/IJWMC.2013.057387","volume":"6","author":"S Schefer-Wenzl","year":"2013","unstructured":"Schefer-Wenzl S, Strembeck M (2013) Modelling context-aware RBAC models for mobile business processes. Int J Wirel Mob Comput 6(5):448\u2013462","journal-title":"Int J Wirel Mob Comput"},{"issue":"4","key":"119_CR43","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/A:1025894003623","volume":"8","author":"I Tsamardinos","year":"2003","unstructured":"Tsamardinos I, Vidal T, Pollack ME (2003) CTP: a new constraint-based formalism for conditional. Temp Plann Constr 8(4):365\u2013388","journal-title":"Temp Plann Constr"},{"issue":"1","key":"119_CR44","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/095281399146607","volume":"11","author":"T Vidal","year":"1999","unstructured":"Vidal T, Fargier H (1999) Handling contingency in temporal constraint networks: from consistency to controllabilities. J Exp Theor Artif Intell 11(1):23\u201345","journal-title":"J Exp Theor Artif Intell"},{"key":"119_CR45","doi-asserted-by":"crossref","unstructured":"Wang Q, Li N (2010) Satisfiability and resiliency in workflow authorization systems. ACM Trans Inf Syst Secur 13(4)40:1\u201340:35","DOI":"10.1145\/1880022.1880034"},{"key":"119_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28616-2","volume-title":"Business process management-concepts, languages, architectures","author":"M Weske","year":"2012","unstructured":"Weske M (2012) Business process management-concepts, languages, architectures, 2nd edn. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-28616-2","edition":"2"},{"issue":"1","key":"119_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.datak.2004.01.001","volume":"50","author":"M Weske","year":"2004","unstructured":"Weske M, van der Aalst WMP, Verbeek HMW (2004) Advances in business process management. Data Knowl Eng 50(1):1\u20138. https:\/\/doi.org\/10.1016\/j.datak.2004.01.001","journal-title":"Data Knowl Eng"},{"key":"119_CR48","doi-asserted-by":"publisher","unstructured":"Weske M, Decker G, Dumas M, La Rosa M, Mendling J, Reijers HA (2020) Model collection of the business process management academic initiative. https:\/\/doi.org\/10.5281\/zenodo.3758705","DOI":"10.5281\/zenodo.3758705"},{"key":"119_CR49","doi-asserted-by":"publisher","unstructured":"Zavatteri M (2017) Conditional simple temporal networks with uncertainty and decisions. In: TIME 2017, vol\u00a090, pp 23:1\u201323:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.TIME.2017.23","DOI":"10.4230\/LIPIcs.TIME.2017.23"},{"key":"119_CR50","unstructured":"Zavatteri M (2019) Temporal and resource controllability of workflows under uncertainty. In: Proceedings of the dissertation award, demonstration, and industrial track at BPM 2019, vol 2420, pp 9\u201314. CEUR-WS.org. http:\/\/ceur-ws.org\/Vol-2420\/paperDA3.pdf"},{"key":"119_CR51","doi-asserted-by":"publisher","unstructured":"Zavatteri M, Combi C, Posenato R, Vigan\u00f2 L (2017) Weak, strong and dynamic controllability of access-controlled workflows under conditional uncertainty. In: BPM 2017, pp 235\u2013251. Springer. https:\/\/doi.org\/10.1007\/978-3-319-65000-5_14","DOI":"10.1007\/978-3-319-65000-5_14"},{"key":"119_CR52","doi-asserted-by":"publisher","unstructured":"Zavatteri M, Combi C, Rizzi R, Vigan\u00f2 L (2019) Hybrid SAT-based consistency checking algorithms for simple temporal networks with decisions. In: TIME 2019, vol 147, p 2:12:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.TIME.2019.2","DOI":"10.4230\/LIPIcs.TIME.2019.2"},{"key":"119_CR53","doi-asserted-by":"publisher","unstructured":"Zavatteri M, Combi C, Rizzi R, Vigan\u00f2 L (2020) Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way. Information and Computation (in-press). https:\/\/doi.org\/10.1016\/j.ic.2020.104637. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540120301255","DOI":"10.1016\/j.ic.2020.104637"},{"key":"119_CR54","doi-asserted-by":"publisher","unstructured":"Zavatteri M, Combi C, Vigan\u00f2 L (2019) Resource controllability of workflows under conditional uncertainty. In: Business process management workshops, pp 68\u201380. Springer. https:\/\/doi.org\/10.1007\/978-3-030-37453-2_7","DOI":"10.1007\/978-3-030-37453-2_7"},{"key":"119_CR55","unstructured":"Zavatteri M, Rizzi R, Villa T (2019) Complexity of weak, strong and dynamic controllability of CNCUs. In: First workshop on formal verification, logic, automata, and synthesis, 2019, OVERLAY 2019, vol 2509, pp 83\u201388. CEUR-WS.org. http:\/\/ceur-ws.org\/Vol-2509\/paper13.pdf"},{"key":"119_CR56","unstructured":"Zavatteri M, Rizzi R, Villa T (2019) Strong controllability of temporal networks with decisions. In: First workshop on formal verification, logic, automata, and synthesis, 2019, OVERLAY 2019, vol 2509, pp 77\u201382. CEUR-WS.org. http:\/\/ceur-ws.org\/Vol-2509\/paper12.pdf"},{"key":"119_CR57","doi-asserted-by":"crossref","unstructured":"Zavatteri M, Rizzi R, Villa T (2020) Dynamic controllability and (J, K)-resiliency in generalized constraint networks with uncertainty. In: Proceedings of the thirtieth international conference on automated planning and scheduling, ICAPS 2020, pp 314\u2013322. AAAI Press","DOI":"10.1609\/icaps.v30i1.6676"},{"key":"119_CR58","doi-asserted-by":"crossref","unstructured":"Zavatteri M, Rizzi R, Villa T (2020) On the complexity of resource controllability in business process management. In: Business process management workshops (to appear). Springer","DOI":"10.1007\/978-3-030-66498-5_13"},{"key":"119_CR59","doi-asserted-by":"publisher","unstructured":"Zavatteri M, Vigan\u00f2 L (2018) Constraint networks under conditional uncertainty. In: ICAART 2018, pp 41\u201352. SciTePress. https:\/\/doi.org\/10.5220\/0006553400410052","DOI":"10.5220\/0006553400410052"},{"key":"119_CR60","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2018.09.023","volume":"797","author":"M Zavatteri","year":"2019","unstructured":"Zavatteri M, Vigan\u00f2 L (2019) Conditional simple temporal networks with uncertainty and decisions. Theor Comput Sci 797:77\u2013101. https:\/\/doi.org\/10.1016\/j.tcs.2018.09.023","journal-title":"Theor Comput Sci"},{"key":"119_CR61","doi-asserted-by":"publisher","unstructured":"Zavatteri M, Vigan\u00f2 L (2019) Conditional uncertainty in constraint networks. In: Agents and artificial intelligence, pp 130\u2013160. Springer. https:\/\/doi.org\/10.1007\/978-3-030-05453-3_7","DOI":"10.1007\/978-3-030-05453-3_7"},{"issue":"3","key":"119_CR62","doi-asserted-by":"publisher","first-page":"343","DOI":"10.3233\/JCS-181244","volume":"27","author":"M Zavatteri","year":"2019","unstructured":"Zavatteri M, Vigan\u00f2 L (2019) Last man standing: static, decremental and dynamic resiliency via controller synthesis. J Comput Secur 27(3):343\u2013373. https:\/\/doi.org\/10.3233\/JCS-181244","journal-title":"J Comput Secur"}],"container-title":["Journal on Data Semantics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13740-021-00119-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13740-021-00119-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13740-021-00119-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T06:22:54Z","timestamp":1671517374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13740-021-00119-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,5]]},"references-count":62,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["119"],"URL":"https:\/\/doi.org\/10.1007\/s13740-021-00119-w","relation":{},"ISSN":["1861-2032","1861-2040"],"issn-type":[{"type":"print","value":"1861-2032"},{"type":"electronic","value":"1861-2040"}],"subject":[],"published":{"date-parts":[[2021,3,5]]},"assertion":[{"value":"3 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}