{"id":8965,"date":"2024-03-12T12:27:05","date_gmt":"2024-03-12T10:27:05","guid":{"rendered":"https:\/\/www.ftf.or.at\/?p=8965"},"modified":"2024-04-15T15:44:18","modified_gmt":"2024-04-15T13:44:18","slug":"supervisory-control-of-business-processes","status":"publish","type":"post","link":"https:\/\/www.ftf.or.at\/?p=8965","title":{"rendered":"Supervisory control of business processes"},"content":{"rendered":"Friday, March 15, 2024 | 10:00 am (CET) | Room: S.2.69 | <\/strong>Universit\u00e4t Klagenfurt<\/strong>\r\n\r\nMatteo Zavatteri | Assistant Professor \u00a0in computer science at the Department of Mathematics of University of Padua, Italy\r\n<\/strong>\r\n\r\nAbstract: <\/strong>A recent direction in Business Process Management studied methodologies to control the execution of Business Processes under several sources of uncertainty in order to always get to the end by satisfying all constraints. Current approaches encode business processes into temporal constraint networks or timed game automata in order to exploit their related strategy synthesis algorithms. However, the proposed encodings can only synthesize single-strategies and fail to handle loops. To overcome these limits I will discuss a recent approach based on supervisory control. The approach considers structured business processes with resources, parallel and mutually exclusive branches, loops, and uncertainty. I will discuss an encoding into finite state automata and prove that their concurrent behavior models exactly all possible executions of the process. After that, I will introduce tentative commitment constraints as a new class of constraints restricting the executions of a process. Finally, I will discuss a tree decomposition of the process that plays a central role in modular supervisory control.\r\n\r\nBio: <\/strong>Matteo Zavatteri is assistant professor in computer science at the Department of \"\"<\/a>Mathematics of University of Padua, Italy. He received a master degree in engineering and computer science and a Ph.D. in computer science from University of Verona (ITALY).\r\n\r\nHis research interests are in the fields of formal methods, discrete event systems, supervisory control, temporal reasoning, artificial intelligence, and business process management. Currently he works in the iNEST (Interconnected Nord-Est Innovation Ecosystem) project, which is a project supported with 110M\u20ac by the National Recovery and Resilience Plan, funded by the European Union in the NextGenerationEU plan. In such a project he develops neuro-symbolic approaches for digital twins.\r\n\r\n