2025
Special issue on verification, control, and repair in business process management
Information Systems, 102619. 2025. DOI
Publications
Editorials
2025
Short Paper Proceedings of the 6th International Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis, OVERLAY 2024, Bolzano, Italy, November 28-29, 2024
CEUR Workshop Proceedings, volume 3904. CEUR-WS.org. 2025. Link
Journals
2026
Certified Neural Networks: from Verification to Synthesis
Journal of Artificial Intelligence Research, 87. 2026. DOI
2025
Data-Aware Process Models: from Soundness Checking to Repair
Data & Knowledge Engineering, 155:102377. 2025. DOI
2023
Supervisory control of business processes with resources, parallel and mutually exclusive branches, loops, and uncertainty
Information Systems, 119:102288. 2023. DOI
2023
Reducing the number of disjuncts in DTPs
Information and Computation, 293:105048. 2023. DOI
2023
An Interdisciplinary Experimental Evaluation on the Disjunctive Temporal Problem
Constraints, 28(1):1–12. 2023. DOI
2022
Dynamic controllability of temporal networks with instantaneous reaction
Information Sciences, 613:932–952. 2022. DOI
2021
Mining CSTNUDs significant for a set of traces is polynomial
Information and Computation, 281. 2021. DOI
2021
Resource Controllability of Business Processes Under Conditional Uncertainty
Journal on Data Semantics, 1–21. 2021. DOI
2021
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way
Information and Computation, 280. 2021. DOI
2019
Conditional simple temporal networks with uncertainty and decisions
Theoretical Computer Science, 797:77–101. 2019. DOI
2019
Conditional Simple Temporal Networks with Uncertainty and Resources
Journal of Artificial Intelligence Research, 64:931–985. 2019. DOI
2019
Last Man Standing: Static, Decremental and Dynamic Resiliency via Controller Synthesis
Journal of Computer Security, 27(3):343–373. 2019. DOI
Conferences, workshops, and symposia
2026
Refusal Before Decoding: Detecting and Exploiting Refusal Signals in Intermediate LLM Activations
In Findings of the Association for Computational Linguistics: EMNLP 2026, pages 28141–28157. Association for Computational Linguistics. 2026. DOI
2026
The Σ-Chain Product: A Succinct Model of Automata (De)Composition
In 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026), volume 146 of Open Access Series in Informatics (OASIcs), pages 3:1–3:17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. 2026. DOI
2026
Iterative In-Context Learning to Enhance LLMs Abstract Reasoning: The Case-Study of Algebraic Tasks
In Proceedings of the 41st ACM/SIGAPP Symposium on Applied Computing, SAC 2026, Grand Hotel Palace, Thessaloniki, Greece, March 23–27, 2026, pages 908–916. ACM. 2026. DOI
2024
Automated Synthesis of Certified Neural Networks: Initial Results and Open Research Lines
In Short Paper Proceedings of the 6th International Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis, OVERLAY 2024, Bolzano, Italy, November 28–29, 2024, volume 3904 of CEUR Workshop Proceedings, pages 77–82. CEUR-WS.org. 2024. Link
2024
Automated Synthesis of Certified Neural Networks
In ECAI 2024 - 27th European Conference on Artificial Intelligence, volume 392 of Frontiers in Artificial Intelligence and Applications, pages 1341–1348. IOS Press. 2024. DOI
2024
Repair of Unsound Data-Aware Process Models
In Business Process Management Workshops, pages 383–395. Springer. 2024. DOI
2023
A Two-Phase Approach to Evaluate and Optimize an Interlibrary Loan Service: The Case Study of Provincia di Brescia
In Operations Research and Data Science in Public Services, pages 17–33. Springer. 2023. DOI
2022
Dynamic Controllability of Temporal Networks via Supervisory Control
In Fourth Workshop on fOrmal VERification, Logic, Automata, and sYnthesis, 2022, OVERLAY 2022, pages 27–31. CEUR-WS.org. 2022. Link
2021
Mining Temporal Networks: Results and Open Problems
In Third Workshop on fOrmal VERification, Logic, Automata, and sYnthesis, 2021, OVERLAY 2021, pages 31–36. CEUR-WS.org. 2021. Link
2021
Faster and Better Simple Temporal Problems
Proceedings of the AAAI Conference on Artificial Intelligence, 35(13):11913–11920. 2021. Link
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, pages 314–322. AAAI Press. 2020. Link
2020
Mining Significant Temporal Networks Is Polynomial
In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020), volume 178 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1–11:12. Schloss Dagstuhl–Leibniz-Zentrum für Informatik. 2020. DOI
2020
On the Complexity of Resource Controllability in Business Process Management
In Business Process Management Workshops, pages 168–180. Springer. 2020. DOI
2019
Conditional Uncertainty in Constraint Networks
In Agents and Artificial Intelligence, pages 130–160. Springer. 2019. DOI
2019
Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions
In 26th International Symposium on Temporal Representation and Reasoning (TIME 2019), volume 147 of Leibniz International Proceedings in Informatics (LIPIcs), pages 16:1–16:17. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. 2019. DOI
2019
Resource Controllability of Workflows Under Conditional Uncertainty
In Business Process Management Workshops, pages 68–80. Springer. 2019. DOI
2019
Temporal and Resource Controllability of Workflows Under Uncertainty
In 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, volume 2420 of CEUR Workshop Proceedings, pages 9–14. CEUR-WS.org. 2019. Link
2019
Strong Controllability of Temporal Networks with Decisions
In First Workshop on fOrmal VERification, Logic, Automata, and sYnthesis, 2019, OVERLAY 2019, pages 77–82. CEUR-WS.org. 2019. Link
2019
Complexity of Weak, Strong and Dynamic Controllability of CNCUs
In First Workshop on fOrmal VERification, Logic, Automata, and sYnthesis, 2019, OVERLAY 2019, pages 83–88. CEUR-WS.org. 2019. Link
2018
Constraint Networks Under Conditional Uncertainty
In 10th International Conference on Agents and Artificial Intelligence — Volume 2, ICAART 2018, pages 41–52. SciTePress. 2018. DOI
2017
Incorporating Decision Nodes into Conditional Simple Temporal Networks
In 24th International Symposium on Temporal Representation and Reasoning, TIME 2017, pages 9:1–9:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 2017. DOI
2017
Conditional Simple Temporal Networks with Uncertainty and Decisions
In 24th International Symposium on Temporal Representation and Reasoning, TIME 2017, pages 23:1–23:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 2017. DOI
2017
Weak, Strong and Dynamic Controllability of Access-Controlled Workflows Under Conditional Uncertainty
In Business Process Management: 15th International Conference, BPM 2017, pages 235–251. Springer International Publishing. 2017. DOI
2017
Access Controlled Temporal Networks
In 9th International Conference on Agents and Artificial Intelligence - Volume 2, ICAART 2017, pages 118–131. ScitePress. 2017. DOI
2016
Security Constraints in Temporal Role-Based Access-Controlled Workflows
In 6th ACM Conference on Data and Application Security and Privacy, CODASPY 2016, pages 207–218. ACM. 2016. DOI
2014
Non-collaborative Attackers and How and Where to Defend Flawed Security Protocols (Extended Version)
In Security Protocols XXII - 22nd International Workshop Cambridge, UK, pages 69–90. Springer. 2014. DOI