A System for Deduction-based Formal Verification of Workflow-oriented Software Models

The work concerns formal verification of workflow-oriented software models using deductive approach. The formal correctness of a model's behaviour is considered. Manually building logical specifications, which are considered as a set of temporal logic formulas, seems to be the significant obstacle for an inexperienced user when applying the deductive approach. A system, and its architecture, for the deduction-based verification of workflow-oriented models is proposed. The process of inference is based on the semantic tableaux method which has some advantages when compared to traditional deduction strategies. The algorithm for an automatic generation of logical specifications is proposed. The generation procedure is based on the predefined workflow patterns for BPMN, which is a standard and dominant notation for the modeling of business processes. The main idea for the approach is to consider patterns, defined in terms of temporal logic,as a kind of (logical) primitives which enable the transformation of models to temporal logic formulas constituting a logical specification. Automation of the generation process is crucial for bridging the gap between intuitiveness of the deductive reasoning and the difficulty of its practical application in the case when logical specifications are built manually. This approach has gone some way towards supporting, hopefully enhancing our understanding of, the deduction-based formal verification of workflow-oriented models.Comment: International Journal of Applied Mathematics and Computer Scienc

Customizing BPMN Diagrams Using Timelines

BPMN (Business Process Model and Notation) is widely used standard modeling technique for representing Business Processes by using diagrams, but lacks in some aspects. Representing execution-dependent and time-dependent decisions in BPMN Diagrams may be a daunting challenge [Carlo Combi et al., 2017]. In many cases such constraints are omitted in order to preserve the simplicity and the readability of the process model. However, for purposes such as compliance checking, process mining, and verification, formalizing such constraints could be very useful. In this paper, we propose a novel approach for annotating BPMN Diagrams with Temporal Synchronization Rules borrowed from the timeline-based planning field. We discuss the expressivity of the proposed approach and show that it is able to capture a lot of complex temporally-related constraints without affecting the structure of BPMN diagrams. Finally, we provide a mapping from annotated BPMN diagrams to timeline-based planning problems that allows one to take advantage of the last twenty years of theoretical and practical developments in the field

Extend Commitment Protocols with Temporal Regulations: Why and How

The proposal of Elisa Marengo's thesis is to extend commitment protocols to explicitly account for temporal regulations. This extension will satisfy two needs: (1) it will allow representing, in a flexible and modular way, temporal regulations with a normative force, posed on the interaction, so as to represent conventions, laws and suchlike; (2) it will allow committing to complex conditions, which describe not only what will be achieved but to some extent also how. These two aspects will be deeply investigated in the proposal of a unified framework, which is part of the ongoing work and will be included in the thesis.Comment: Proceedings of the Doctoral Consortium and Poster Session of the 5th International Symposium on Rules (RuleML 2011@IJCAI), pages 1-8 (arXiv:1107.1686

Enhancing BPMN Conformance Checking with OR Gateways and Data Objects

Äriprotsessimudel ja -notatsioon (BPMN) on arenev standard äriprotsesside graafiliseks kujutamiseks. Protsessimudel kirjeldab, kuidas äriprotsess peaks toimima. Kui äriprotsessi tegelikust käitamisest on saadaval ka sündmuste logi, on võimalik vastata küsimusele, kas protsessimudel vastab tegelikkusele. Vastavusanalüüs püüab tuvastada mittevastavusi protsessimudeli ja äriprotsessi käitamisel tekkinud sündmuste logi vahel. BPMN vastavuseanalüsaator on üks Itaalia ettevõtte SIAV-i poolt arendatud protsessikaeve tööriista osadest. Nimetatud tööriistal on aga puudujäägid formaalse semantika osas. Nimelt keskendub vastavusanalüüs järgnevuse voole (control-flow) protsessis, kuid jätab arvesse võtmata andmetevahelisi sõltuvusi. Lisaks ei ole vastavusanalüüsil võimalik kasutada protsessimudeleid, mis sisaldavad OR väravaid (OR gateway). OR-join omab mitme-tähenduslikku semantikat. Se lle konstruktsiooni jaoks on pakutud mitmeid formaalseid semantikaid sarnastes keeltes, nagu EPCs ja YAWL. Nimetatud semantikate kasutatamine mudelite käitamisel ja vastavuse analaüüsil on aga arvutuslikult kulukas. Seega on käesolevas lõputöös implementeeritud OR värava aktiveerimine lineaarse ajalise sõltuvusega mudeli suuruse suhtes. Kuna SIAV-i vastavusanalüsaator ei võta arvesse andmetevahelisi sõltuvusi, võib puudulik analüüs viia vigase vastavusdiagnostikani. Näiteks võib andmeatribuut anda infot selle kohta, et käitati vale tegevus. Kirjeldatud põhjustel ei peaks vastavusanalüsaator tegelema vaid järgnevuse voo vastavuse analüüsiga, vaid peaks arvesse võtma ka andmeid ja nendevahelisi sõltuvusi ning aega. Käesoleva töö teises osas täiendati olemasolevat andmeanalüsaatorit andmeatribuutidega.The Business Process Model and Notation is a developing standard for capturing business processes. Process models describe how the business process is expected to be executed. When a log is available from process executions, this situation raises the interesting question “Are the model and the log conformant?". Conformance checking, also referred to as conformance analysis, aims at the detection of inconsistencies between a process model and its corresponding execution log.The BPMN conformance checker, as a part of a process mining tool, developed an Italian company called SIAV, however, this tool lacks some formal semantics. In particular, the previous conformance checking approach in SIAV tends to focus on the control-flow in a process, while abstracting from data dependencies and process models containing OR gateways could not be used.OR-join has an ambiguous semantics. The several formal semantics of this construct have been proposed for similar languages such as EPCs and YAWL. However, executing and verifying models using these semantics is computationally expensive. Therefore, in this thesis, we implemented enablement of an OR-join in linear time in the size of the workflow graph.Data dependencies are also not considered in conformance checker developed in SIAV, which may lead to misleading conformance diagnostics. For example, a data attribute may provide strong evidence that the wrong activity was executed. That’s why the conformance checker should not only describe the process behaviour from the control flow point of view, but also from other perspectives like data or time. In the second part of the thesis, we enhanced the existing conformance checker with data attributes

Business process specification, verification, and deployment in a mono-cloud, multi-edge context

© 2020, ComSIS Consortium. All rights reserved. Despite the prevalence of cloud and edge computing, ensuring the satisfaction of time-constrained business processes, remains challenging. Indeed, some cloud/edge-based resources might not be available when needed leading to delaying the execution of these processes’ tasks and/or the transfer of these processes’ data. This paper presents an approach for specifying, verifying, and deploying time-constrained business processes in a mono-cloud, multi-edge context. First, the specification and verification of processes happen at design-time and run-time to ensure that these processes’ tasks and data are continuously placed in a way that would mitigate the violation of time constraints. This mitigation might require moving tasks and/or data from one host to another to reduce time latency, for example. A host could be either a cloud, an edge, or any. Finally, the deployment of processes using a real case-study allowed to confirm the benefits of the early specification and verification of these processes in mitigating time constraints violations

Specification-Driven Predictive Business Process Monitoring

Predictive analysis in business process monitoring aims at forecasting the future information of a running business process. The prediction is typically made based on the model extracted from historical process execution logs (event logs). In practice, different business domains might require different kinds of predictions. Hence, it is important to have a means for properly specifying the desired prediction tasks, and a mechanism to deal with these various prediction tasks. Although there have been many studies in this area, they mostly focus on a specific prediction task. This work introduces a language for specifying the desired prediction tasks, and this language allows us to express various kinds of prediction tasks. This work also presents a mechanism for automatically creating the corresponding prediction model based on the given specification. Differently from previous studies, instead of focusing on a particular prediction task, we present an approach to deal with various prediction tasks based on the given specification of the desired prediction tasks. We also provide an implementation of the approach which is used to conduct experiments using real-life event logs.Comment: This article significantly extends the previous work in https://doi.org/10.1007/978-3-319-91704-7_7 which has a technical report in arXiv:1804.00617. This article and the previous work have a coauthor in commo