{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T21:28:50Z","timestamp":1789939730179,"version":"4.0.1"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T00:00:00Z","timestamp":1658966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC Advanced Grant WhiteMech","award":["834228), EU ICT-48 2020"],"award-info":[{"award-number":["834228), EU ICT-48 2020"]}]},{"name":"TAILOR","award":["952215"],"award-info":[{"award-number":["952215"]}]},{"name":"PRIN projects RIPER","award":["20203FFYLK"],"award-info":[{"award-number":["20203FFYLK"]}]},{"name":"PINPOINT","award":["2020FNEB27"],"award-info":[{"award-number":["2020FNEB27"]}]},{"name":"UNIBZ projects WineID, VERBA, and SMART-APP"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2022,10,31]]},"abstract":"<jats:p>\n            Runtime monitoring is a central operational decision support task in business process management. It helps process executors to check on-the-fly whether a running process instance satisfies business constraints of interest, providing an immediate feedback when deviations occur. We study runtime monitoring of properties expressed in\n            <jats:sc>ltl<\/jats:sc>\n            <jats:sub>\n              <jats:italic>f<\/jats:italic>\n            <\/jats:sub>\n            , a variant of the classical\n            <jats:sc>ltl<\/jats:sc>\n            (Linear-time Temporal Logic) that is interpreted over finite traces, and in its extension\n            <jats:sc>ldl<\/jats:sc>\n            <jats:sub>\n              <jats:italic>f<\/jats:italic>\n            <\/jats:sub>\n            , a powerful logic obtained by combining\n            <jats:sc>ltl<\/jats:sc>\n            <jats:sub>\n              <jats:italic>f<\/jats:italic>\n            <\/jats:sub>\n            with regular expressions. We show that\n            <jats:sc>ldl<\/jats:sc>\n            <jats:sub>\n              <jats:italic>f<\/jats:italic>\n            <\/jats:sub>\n            is able to declaratively express, in the logic itself, not only the constraints to be monitored, but also the de facto standard\n            <jats:sc>rv<\/jats:sc>\n            -LTL monitors. On the one hand, this enables us to directly employ the standard characterization of\n            <jats:sc>ldl<\/jats:sc>\n            <jats:sub>\n              <jats:italic>f<\/jats:italic>\n            <\/jats:sub>\n            based on finite-state automata to monitor constraints in a fine-grained way. On the other hand, it provides the basis for declaratively expressing sophisticated metaconstraints that predicate on the monitoring state of other constraints, and to check them by relying on standard logical services instead of ad hoc algorithms. We then report on how this approach has been effectively implemented using Java to manipulate\n            <jats:sc>ldl<\/jats:sc>\n            <jats:sub>\n              <jats:italic>f<\/jats:italic>\n            <\/jats:sub>\n            formulae and their corresponding monitors, and the\n            <jats:sc>RuM<\/jats:sc>\n            rule mining suite as underlying infrastructure.\n          <\/jats:p>","DOI":"10.1145\/3506799","type":"journal-article","created":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T12:30:08Z","timestamp":1653049808000},"page":"1-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces"],"prefix":"10.1145","volume":"31","author":[{"given":"Giuseppe","family":"De Giacomo","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Roma, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riccardo","family":"De Masellis","sequence":"additional","affiliation":[{"name":"Uppsala University, Uppsala, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabrizio Maria","family":"Maggi","sequence":"additional","affiliation":[{"name":"Free University of Bozen-Bolzano, Bolzano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8021-3430","authenticated-orcid":false,"given":"Marco","family":"Montali","sequence":"additional","affiliation":[{"name":"Free University of Bozen-Bolzano, Bolzano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,28]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPM49681.2020.00027"},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Anti Alman Claudio Di Ciccio Fabrizio Maria Maggi Marco Montali and Han van der Aa. 2021. RuM: Declarative process mining distilled. Lecture Notes in Computer Science Vol. 12875 Artem Polyvyanyy Moe Thandar Wynn Amy Van Looy and Manfred Reichert (Eds.). Springer 23\u201329.","DOI":"10.1007\/978-3-030-85469-0_3"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i06.6528"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exn075"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2000799.2000800"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.08.007"},{"key":"e_1_3_2_8_2","series-title":"Proceedings of the 19th International Conference on Business Process Management (BPM\u201921)","first-page":"200","author":"Bottrighi Alessio","year":"2011","unstructured":"Alessio Bottrighi, Federico Chesani, Paola Mello, Marco Montali, Stefania Montani, and Paolo Terenziani. 2011. Conformance checking of executed clinical guidelines in presence of basic medical knowledge. In Proceedings of the 19th International Conference on Business Process Management (BPM\u201921)(Lecture Notes in Business Information Processing, Vol. 100), Florian Daniel, Kamel Barkaoui, and Schahram Dustdar (Eds.). Springer, 200\u2013211."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11572"},{"key":"e_1_3_2_10_2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-642-29414-3_8","volume-title":"Logic Programs, Norms and Action - Essays in Honor of Marek J. Sergot on the Occasion of His 60th Birthday","author":"Bragaglia Stefano","year":"2012","unstructured":"Stefano Bragaglia, Federico Chesani, Paola Mello, Marco Montali, and Paolo Torroni. 2012. Reactive event calculus for monitoring global computing applications. In Logic Programs, Norms and Action - Essays in Honor of Marek J. Sergot on the Occasion of His 60th Birthday(Lecture Notes in Computer Science, Vol. 7360), Alexander Artikis, Robert Craven, Nihan Kesim Cicekli, Babak Sadighi, and Kostas Stathis (Eds.). Springer, 123\u2013146."},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Diego Calvanese Giuseppe De Giacomo Maurizio Lenzerini and Moshe Y. Vardi. 2009. An automata-theoretic approach to regular XPath. Lecture Notes in Computer Science Vol. 5708. Springer 18\u201335.","DOI":"10.1007\/978-3-642-03793-1_2"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/767"},{"key":"e_1_3_2_13_2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-319-28007-3_5","volume-title":"Foundations of Biomedical Knowledge Representation\u2014Methods and Applications (Lecture Notes in Computer Science,","author":"Chesani Federico","year":"2015","unstructured":"Federico Chesani, Catherine G. Enright, Marco Montali, and Michael G. Madden. 2015. Monitoring in the healthcare setting. In Foundations of Biomedical Knowledge Representation\u2014Methods and Applications (Lecture Notes in Computer Science, Vol. 9521), Arjen Hommersom and Peter J. F. Lucas (Eds.). Springer, 71\u201380."},{"key":"e_1_3_2_14_2","unstructured":"Lecture Notes in Computer Science Proceedings of the 5th International Workshop on Web Services and Formal Methods (WS-FM\u201908) Federico Chesani Paola Mello Marco Montali Paolo Torroni Verification of choreographies during execution using the reactive event calculus 2008"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.5555\/2010403.2010410"},{"key":"e_1_3_2_16_2","volume-title":"XML Path Language (XPath) Version 1.0","author":"Clark James","year":"1999","unstructured":"James Clark and Steve DeRose. 1999. XML Path Language (XPath) Version 1.0. W3C Recommendation. World Wide Web Consortium. https:\/\/www.w3.org\/TR\/1999\/REC-xpath-19991116\/."},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Giuseppe De Giacomo Riccardo De Masellis Marco Grasso Fabrizio Maria Maggi and Marco Montali. 2014. Monitoring business metaconstraints based on LTL and LDL for finite traces. Lecture Notes in Computer Science Vol. 8659. Springer.","DOI":"10.1007\/978-3-319-10172-9_1"},{"key":"e_1_3_2_18_2","first-page":"122","volume-title":"Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS\u201921)","author":"Giacomo Giuseppe De","year":"2021","unstructured":"Giuseppe De Giacomo and Marco Favorito. 2021. Compositional approach to translate LTLf\/LDLf into deterministic finite automata. In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS\u201921), Susanne Biundo, Minh Do, Robert Goldman, Michael Katz, Qiang Yang, and Hankz Hankui Zhuo (Eds.). AAAI Press, 122\u2013130."},{"key":"e_1_3_2_19_2","first-page":"4729","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"Giacomo Giuseppe De","year":"2018","unstructured":"Giuseppe De Giacomo and Sasha Rubin. 2018. Automata-theoretic foundations of FOND planning for LTL \\( _f \\) \/LDL \\( _f \\) goals. In Proceedings of the International Joint Conference on Artificial Intelligence. 4729\u20134735."},{"key":"e_1_3_2_20_2","volume-title":"Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI\u201913)","author":"Giacomo Giuseppe De","year":"2013","unstructured":"Giuseppe De Giacomo and Moshe Y. Vardi. 2013. Linear temporal logic and linear dynamic logic on finite traces. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI\u201913). AAAI."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/2600821.2600835"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/302405.302672"},{"key":"e_1_3_2_23_2","volume-title":"Reinforcement Learning for LTLf\/LDLf Goals: Theory and Implementation.MEng Thesis. Sapienza University of Rome","author":"Favorito Marco","year":"2018","unstructured":"Marco Favorito. 2018. Reinforcement Learning for LTLf\/LDLf Goals: Theory and Implementation.MEng Thesis. Sapienza University of Rome. Retrieved from https:\/\/github.com\/marcofavorito\/master-thesis\/blob\/master\/thesis.pdf."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.5555\/2534474"},{"key":"e_1_3_2_26_2","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"Stasio Lucas M. Tabajara Moshe Vardi Shufang Zhu Giuseppe De Giacomo, Antonio Di","year":"2021","unstructured":"Lucas M. Tabajara Moshe Vardi Shufang Zhu Giuseppe De Giacomo, Antonio Di Stasio. 2021. Finite-trace and generalized-reactivity specifications in temporal synthesis. In Proceedings of the International Joint Conference on Artificial Intelligence. ijcai.org."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054115400110"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.5555\/557365"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.5555\/1454320"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2005.97780"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037383"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-017-0442-2"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/EDOC.2013.11"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23059-2_13"},{"key":"e_1_3_2_35_2","unstructured":"Fabrizio Maria Maggi Michael Westergaard Marco Montali and Wil M. P. van der Aalst. 2012. Runtime verification of LTL-based declarative process models. Lecture Notes in Computer Science Vol. 7186. Springer."},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786824"},{"key":"e_1_3_2_37_2","doi-asserted-by":"crossref","unstructured":"Maarten Marx. 2004. XPath with conditional axis relations. Lecture Notes in Computer Science Vol. 2992. Springer 477\u2013494.","DOI":"10.1007\/978-3-540-24741-8_28"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14538-4"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/2542182.2542199"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/1658373.1658376"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.5555\/1890507.1890512"},{"key":"e_1_3_2_42_2","doi-asserted-by":"crossref","unstructured":"Gyunam Park and Wil M. P. van der Aalst. 2020. A general framework for action-oriented process mining. Lecture Notes in Business Information Processing Vol. 397 Adela del-R\u00edo-Ortega Henrik Leopold and Fl\u00e1via Maria Santoro (Eds.). Springer 206\u2013218.","DOI":"10.1007\/978-3-030-66498-5_16"},{"key":"e_1_3_2_43_2","volume-title":"Constraint-based Workflow Management Systems: Shifting Controls to Users","author":"Pesic Maja","year":"2008","unstructured":"Maja Pesic. 2008. Constraint-based Workflow Management Systems: Shifting Controls to Users. Ph.D. Dissertation. Beta Research School for Operations Management and Logistics, Eindhoven."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/EDOC.2007.14"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/11837862_18"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2020.103377"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75293"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00370671"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.07.040"},{"key":"e_1_3_2_51_2","first-page":"1","volume-title":"Proceedings of the Symposium on Theory of Computing (STOC\u201973)","author":"Stockmeyer L. J.","year":"1973","unstructured":"L. J. Stockmeyer and A. R. Meyer. 1973. Word problems requiring exponential time. In Proceedings of the Symposium on Theory of Computing (STOC\u201973). 1\u20139."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.326.1"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/11591191_28"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49851-4"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23059-2_10"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/189"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3506799","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3506799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:50Z","timestamp":1750191110000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3506799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,28]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10,31]]}},"alternative-id":["10.1145\/3506799"],"URL":"https:\/\/doi.org\/10.1145\/3506799","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,28]]},"assertion":[{"value":"2019-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}