[1]

Papazoglou MP, Traverso P, Dustdar S, Leymann F. 2007. Service-oriented computing: state of the art and research challenges. Computer 40(11):38−45

doi: 10.1109/MC.2007.400
[2]

Berardi D, Calvanese D, De Giacomo G, Lenzerini M, Mecella M. 2003. Automatic composition of E-services that export their behavior. In Service-Oriented Computing - ICSOC 2003. Lecture Notes in Computer Science. Vol. 2910. Berlin, Heidelberg: Springer. pp. 43–58 doi: 10.1007/978-3-540-24593-3_4
[3]

Berardi D, Calvanese D, De Giacomo G, Mecella M. 2005. Composition of services with nondeterministic observable behavior. In Service-Oriented Computing ICSOC2005. Lecture Notes in Computer Science. Vol. 3826. Berlin, Heidelberg: Springer. pp. 520–526 doi: 10.1007/11596141_43
[4]

De Giacomo G, Mecella M, Patrizi F. 2013. Automated service composition based on behaviors: the Roman model. In Web Services Foundations. New York, NY: Springer. pp. 189–214 doi: 10.1007/978-1-4614-7518-7_8
[5]

Monti F, Silo L, Leotta F, Mecella M. 2023. On the suitability of AI for service-based adaptive supply chains in smart manufacturing. 2023 IEEE International Conference on Web Services (ICWS). July 2–8, 2023. Chicago, IL, USA. USA: IEEE. pp. 704–706 doi: 10.1109/icws60048.2023.00091
[6]

Monti F, Silo L, Leotta F, Mecella M. 2023. Services in smart manufacturing: comparing automated reasoning techniques for composition and orchestration. Service-Oriented Computing. SummerSOC 2023. Communications in Computer and Information Science. vol 1847. Cham: Springer. pp. 69–83 doi: 0.1007/978-3-031-45728-9_5
[7]

De Giacomo G, Favorito M, Leotta F, Mecella M, Silo L. 2023. Digital twin composition in smart manufacturing via Markov decision processes. Computers in Industry 149:103916

doi: 10.1016/j.compind.2023.103916
[8]

Yadav N, Sardina S. 2011. Decision theoretic behavior composition. AAMAS '11: The 10th International Conference on Autonomous Agents and Multiagent Systems, 2−6 May, 2011, Taipei, Taiwan, China. USA: International Foundation for Autonomous Agents and Multiagent Systems. pp. 575−582 doi: 10.65109/zgyz4787
[9]

Brafman RI, De Giacomo G, Mecella M, Sardina S. 2017. Service composition in stochastic settings. AI*IA 2017 Advances in Artificial Intelligence. Lecture Notes in Computer Science. Cham: Springer. pp. 159–171 doi: 10.1007/978-3-319-70169-1_12
[10]

Marrella A, Mecella M, Sardiña S. 2018. Supporting adaptiveness of cyber-physical processes through action-based formalisms. AI Communications 31(1):47−74

doi: 10.3233/aic-170748
[11]

De Giacomo G, Vardi MY. 2013. Linear temporal logic and linear dynamic logic on finite traces. IJCAI '13: Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, 3–9 August, 2013, Beijing, China. USA: AAAI Press. pp. 854–860 https://dl.acm.org/doi/10.5555/2540128.2540252
[12]

Debois S, Hildebrandt TT, Laursen PH, Ulrik KR. 2007. Declarative process mining for DCR graphs. SAC '17: Proceedings of the Symposium on Applied Computing, 3−7 April, 2017, Marrakech Morocco. USA: Association for Computing Machinery. pp. 759–764 doi: 10.1145/3019612.3019622
[13]

Di Ciccio C, Montali M. 2022. Declarative process specifications: reasoning, discovery, monitoring. In Process Mining Handbook. Lecture Notes in Business Information Processing. Vol. 448. Cham: Springer. pp. 108–152 doi: 10.1007/978-3-031-08848-3_4
[14]

Dumas M, Fournier F, Limonad L, Marrella A, Montali M, et al. 2023. AI-augmented business process management systems: a research manifesto. ACM Transactions on Management Information Systems 14(1):1−19

doi: 10.1145/3576047
[15]

De Giacomo G, Favorito M, Leotta F, Mecella M, Silo L. 2021. Digital twins composition via Markov decision processes. Proceedings of the 1st Italian Forum on Business Process Management, co-located with the 19th International Conference of Business Process Management (BPM 2021). Rome, Italy, 10th September, 2021. Vol. 2952. CEUR Workshop Proceedings. pp. 44–49 https://ceur-ws.org/Vol-2952/paper_297a.pdf
[16]

De Giacomo G, Favorito M, Leotta F, Mecella M, Silo L. 2022. Modeling resilient cyberphysical processes and their composition from digital twins via Markov Decision Processes. In Proceedings of the Workshop on Process Management in the AI Era (PMAI 2022), co-located with 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022). Wien, Austria, 23 July, 2022. Vol. 3310. CEUR Workshop Proceedings. pp. 101–104 https://ceur-ws.org/Vol-3310/paper7.pdf
[17]

De Giacomo G, Favorito M, Leotta F, Mecella M, Monti F, et al. 2023. AIDA: a tool for resiliency in smart manufacturing. Intelligent Information Systems. CAiSE 2023. Lecture Notes in Business Information Processing. Vol. 477. Cham: Springer. pp. 112–120 doi: 10.1007/978-3-031-34674-3_14
[18]

Chatterjee K, Majumdar R, Henzinger TA. 2006. Markov decision processes with multiple objectives. In: STACS Lecture Notes in Computer Science. Vol. 3884. Berlin, Heidelberg: Springer. pp. 325–336 doi: 10.1007/11672142_26
[19]

Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. In Computer Aided Verification. CAV 2020. Lecture Notes in Computer Science. Vol. 12225. Cham: Springer, 2020, pp. 398–420 doi: 10.1007/978-3-030-53291-8_21
[20]

Hahn EM, Perez M, Schewe S, Somenzi F, Trivedi A, et al. 2021. Model-free reinforcement learning for lexicographic omega-regular objectives. In Formal Methods. FM 2021. Lecture Notes in Computer Science. Vol. 13047. Lecture Notes in Computer Science. Cham: Springer. pp. 142–159 doi: 10.1007/978-3-030-90870-6_8
[21]

Skalse J, Hammond L, Griffin C, Abate A. 2022. Lexicographic multi-objective reinforcement learning. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-ECAI 2022). pp. 3430–3436 www.ijcai.org/proceedings/2022/0476.pdf
[22]

Wray KH, Zilberstein S, Mouaddib AI. 2015. Multi-objective MDPs with conditional lexicographic reward preferences. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. 25−30 January, 2015, Austin, Texas. USA: AAAI Press. pp. 3418−3424 https://ojs.aaai.org/index.php/AAAI/article/view/9647
[23]

Skalse J, Abate A. 2023. On the limitations of Markovian rewards to express multiobjective, risk-sensitive, and modal tasks. In 39th Conference on Uncertainty in Artificial Intelligence, 31st July–4th August, 2023, Pittsburgh, PA, USA. Vol. 216. pp. 1974–1984 https://dl.acm.org/doi/10.5555/3625834.3626019
[24]

Puterman ML. 1994. Markov decision processes: discrete stochastic dynamic programming. New York, USA: John Wiley & Sons. 672 pp. https://dl.acm.org/doi/10.5555/528623
[25]

Gao A, Yang D, Tang S, Zhang M. 2005. Web service composition using Markov Decision Processes. In WAIM. Vol. 3739. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005, pp. 308–319 doi: 10.1007/11563952_28
[26]

Chen K, Xu J, Reiff-Marganiec S. 2009. Markov-HTN planning approach to enhance flexibility of automatic web service composition. 2009 IEEE International Conference on Web Services. 6–10 July, 2009, Los Angeles, CA, USA. USA: IEEE. pp. 9–16 doi: 10.1109/ICWS.2009.43
[27]

Moustafa A, Zhang M. 2013. Multi-objective service composition using reinforcement learning. In Service-Oriented Computing. ICSOC 2013. Lecture Notes in Computer Science. Vol. 8274. Berlin, Heidelberg: Springer. pp. 298–312 doi: 10.1007/978-3-642-45005-1_21
[28]

YChen Y, Huang J, Lin C, Shen X. 2019. Multi-objective service composition with QoS dependencies. IEEE Transactions on Cloud Computing 7(2):537−552

doi: 10.1109/tcc.2016.2607750
[29]

Sadeghiram S, Ma H, Chen G. 2020. A user-preference driven lexicographic approach for multi-objective distributed Web service composition. 2020 IEEE Symposium Series on Computational Intelligence (SSCI). 1−4 December, 2020, Canberra, ACT, Australia. USA: IEEE. pp. 791−797 doi: 10.1109/ssci47803.2020.9308222
[30]

De Giacomo G, Favorito M, Silo L. 2024. Composition of stochastic services for LTLf goal specifications. In Foundations of Information and Knowledge Systems. Lecture Notes in Computer Science. Vol. 14589. Cham: Springer. pp. 298–316 doi: 10.1007/978-3-031-56940-1_17
[31]

De Giacomo G, Vardi MY. 2015. Synthesis for LTL and LDL on finite traces. IJCAI'15: Proceedings of the 24th International Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina. USA: AAAI Press. pp. 1558–1564 https://dl.acm.org/doi/10.5555/2832415.2832466
[32]

De Giacomo G, Di Stasio A, Tabajara LM, Vardi MY, Zhu S. 2022. Finite-trace and generalized-reactivity specifications in temporal synthesis. Formal Methods in System Design 61(2):139−163

doi: 10.1007/s10703-023-00413-2
[33]

Aminof B, De Giacomo G, Di Stasio A, Francon H, Rubin S, et al. 2025. LTLf synthesis under environment specifications for reachability and safety properties. Information and Computation 303:105255

doi: 10.1016/j.ic.2024.105255
[34]

Aminof B, De Giacomo G, Rubin S, Vardi MY. 2025. LTLf+ and PPLTL+: extending LTLf and PPLTL to infinite traces. In: Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence. 16–22 August 2025, Montreal, Canada, with satellite event in Guangzhou, China, 29–31 August 2025. ijcai.org, 2025, pp. 8447–8455 www.ijcai.org/proceedings/2025/0939.pdf
[35]

Busatto-Gaston D, Chakraborty D, Majumdar A, Mukherjee S, Pérez GA, et al. 2023. Bi-objective lexicographic optimization in markov decision processes with related objectives. In Automated Technology for Verification and Analysis. ATVA 2023. Lecture Notes in Computer Science. Vol. 14215. Cham: Springer. pp. 203–223 doi: 10.1007/978-3-031-45329-8_10
[36]

Fionda V, Greco G. 2018. LTL on finite and process traces: complexity results and a practical reasoner. Journal of Artificial Intelligence Research 63:557−623

doi: 10.1613/jair.1.11256
[37]

Brafman RI, De Giacomo G, Patrizi F. 2018. LTLf/LDLf non-markovian rewards. Artificial Intelligence 331:1771−1778

doi: 10.1016/j.artint.2024.104113
[38]

De Alfaro L. 1997. Formal verification of probabilistic systems. PhD thesis. Stanford University, USA. https://searchworks.stanford.edu/view/3910936.
[39]

Courcoubetis C, Yannakakis M. 1995. The complexity of probabilistic verification. Journal of the ACM 42(4):857−907

doi: 10.1145/210332.210339
[40]

Wells AM, Lahijanian M, Kavraki LE, Vardi MY. 2020. LTLf synthesis on probabilistic systems. Electronic Proceedings in Theoretical Computer Science 326:166−181

doi: 10.4204/eptcs.326.11
[41]

De Giacomo G, Favorito M, Silo L. 2025. Service composition for ltl task specifications. Information Systems 133:102571

doi: 10.1016/j.is.2025.102571
[42]

De Giacomo G, De Masellis R, Montali M. 2014. Reasoning on LTL on finite traces: insensitivity to infiniteness. Proceedings of the AAAI Conference on Artificial Intelligence 28:1027−1033

doi: 10.1609/aaai.v28i1.8872
[43]

Kwiatkowska M, Norman G, Parker D. 2011. PRISM 4.0: verification of probabilistic real-time systems. In Computer Aided Verification. CAV 2011. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. pp. 585−591 doi: 10.1007/978-3-642-22110-1_47
[44]

Hensel C, Junges S, Katoen JP, Quatmann T, Volk M. 2022. The probabilistic model checker storm. International Journal on Software Tools for Technology Transfer 24(4):589−610

doi: 10.1007/s10009-021-00633-z