Presentation of the paper entitled “Ensuring Model Consistency in Declarative Process Discovery” (http://dx.doi.org/10.1007/978-3-319-23063-4_9) at the 13th International Conference on Business Process Management (BPM 2015), Innsbruck, Austria.
The main theme is the description of an automated technique to detect inconsistencies within mined declarative process models.
Slides of the presentation held at the Humboldt University of Berlin on 2016, December the 7th.
Abstract:
The declarative modelling of business processes is based upon the specification of behavioural rules that constrain the work-flows enactment. It is meant not to explicitly specify every possible execution path from the beginning to the end: The carry-out of the process is up to the actors, who can vary the execution dynamics as long as they do not violate the constraints imposed by the declarative model. The constraints specify the conditions that require or forbid the execution of activities, either considering them singularly or depending on the occurrence of other ones. In this talk, the recent advancements in the automated discovery of declarative control flows from event logs are discussed, together with open challenges in the field.
Declarative Specification of Processes: Discovery and ReasoningClaudio Di Ciccio
A process describes the temporal evolution of a system. Capturing the rules that govern its control flow helps to understand the boundaries of its behaviour. The declarative specification of processes is based on the representation of those boundaries by means of constraints rooted in temporal logics. The execution dynamics can vary as long as they do not violate such constraints, which specify the conditions that require or forbid the execution of actions.
This talk revolves around the recent advancements in research concerning the discovery of, and reasoning on, the declarative specifications of processes. The discourse will include a focus on how to automatically extract the constraints from process data, and how to losslessly minimise the size of discovered constraint sets. The conclusion will illustrate open challenges and future research avenues in the field.
Introduction to the declarative specification of processesClaudio Di Ciccio
This slides deck contains a short introduction to the declarative specification of processes, with examples of how to describe a process with the Declare language.
Resolving Inconsistencies and Redundancies in Declarative Process ModelsClaudio Di Ciccio
Presentation of the article entitled “Semantical Vacuity Detection in Declarative Process Mining”
(https://doi.org/10.1016/j.is.2016.09.005), held at EMISA 2017, Essen, Germany (https://www2.informatik.hu-berlin.de/emisa2017/).
Declarative process models are specifications of workflows based on constraints. Any sequence of activities is allowed, as long as the constraints are not violated. To discover declarative models out of IT systems’ logs, existing techniques verify every possible constraint candidate against the recorded data. Those that hold true are included in the resulting model. A first issue is that some returned constraints can contradict one another, with the result that the model does not accept any execution and turns out to be unusable. A second challenge is the reduction of returned constraints to a minimum set of significant ones, for the sake of readability. Due to their computational complexity, none of those issues had been successfully tackled in the past. Our paper formally frames these problems and formulates an algorithmic solution for both. Its validity and efficiency are demonstrated by extensive experiments on real-world data.
Presented at the 12th International Conference on Business Process Management (BPM 2014), 7-11 September 2014, Eindhoven, The Netherlands.
Abstract: Process discovery is the task of generating models from event logs. Mining processes that operate in an environment of high variability is an ongoing research challenge because various algorithms tend to produce spaghetti-like models. This is particularly the case when procedural models are generated. A promising direction to tackle this challenge is the usage of declarative process modelling languages like Declare, which summarise complex behaviour in a compact set of behavioural constraints. However, Declare constraints with branching are expensive to be calculated.In addition, it is often the case that hundreds of branching Declare constraints are valid for the same log, thus making, again, the discovery results unreadable. In this paper, we address these problems from a theoretical angle. More specifically, we define the class of Target- Branched Declare constraints and investigate the formal properties it exhibits. Furthermore, we present a technique for the efficient discovery of compact Target-Branched Declare models. We discuss the merits of our work through an evaluation based on a prototypical implementation using both artificial and real-world event logs.
Slides of the presentation held at the Humboldt University of Berlin on 2016, December the 7th.
Abstract:
The declarative modelling of business processes is based upon the specification of behavioural rules that constrain the work-flows enactment. It is meant not to explicitly specify every possible execution path from the beginning to the end: The carry-out of the process is up to the actors, who can vary the execution dynamics as long as they do not violate the constraints imposed by the declarative model. The constraints specify the conditions that require or forbid the execution of activities, either considering them singularly or depending on the occurrence of other ones. In this talk, the recent advancements in the automated discovery of declarative control flows from event logs are discussed, together with open challenges in the field.
Declarative Specification of Processes: Discovery and ReasoningClaudio Di Ciccio
A process describes the temporal evolution of a system. Capturing the rules that govern its control flow helps to understand the boundaries of its behaviour. The declarative specification of processes is based on the representation of those boundaries by means of constraints rooted in temporal logics. The execution dynamics can vary as long as they do not violate such constraints, which specify the conditions that require or forbid the execution of actions.
This talk revolves around the recent advancements in research concerning the discovery of, and reasoning on, the declarative specifications of processes. The discourse will include a focus on how to automatically extract the constraints from process data, and how to losslessly minimise the size of discovered constraint sets. The conclusion will illustrate open challenges and future research avenues in the field.
Introduction to the declarative specification of processesClaudio Di Ciccio
This slides deck contains a short introduction to the declarative specification of processes, with examples of how to describe a process with the Declare language.
Resolving Inconsistencies and Redundancies in Declarative Process ModelsClaudio Di Ciccio
Presentation of the article entitled “Semantical Vacuity Detection in Declarative Process Mining”
(https://doi.org/10.1016/j.is.2016.09.005), held at EMISA 2017, Essen, Germany (https://www2.informatik.hu-berlin.de/emisa2017/).
Declarative process models are specifications of workflows based on constraints. Any sequence of activities is allowed, as long as the constraints are not violated. To discover declarative models out of IT systems’ logs, existing techniques verify every possible constraint candidate against the recorded data. Those that hold true are included in the resulting model. A first issue is that some returned constraints can contradict one another, with the result that the model does not accept any execution and turns out to be unusable. A second challenge is the reduction of returned constraints to a minimum set of significant ones, for the sake of readability. Due to their computational complexity, none of those issues had been successfully tackled in the past. Our paper formally frames these problems and formulates an algorithmic solution for both. Its validity and efficiency are demonstrated by extensive experiments on real-world data.
Presented at the 12th International Conference on Business Process Management (BPM 2014), 7-11 September 2014, Eindhoven, The Netherlands.
Abstract: Process discovery is the task of generating models from event logs. Mining processes that operate in an environment of high variability is an ongoing research challenge because various algorithms tend to produce spaghetti-like models. This is particularly the case when procedural models are generated. A promising direction to tackle this challenge is the usage of declarative process modelling languages like Declare, which summarise complex behaviour in a compact set of behavioural constraints. However, Declare constraints with branching are expensive to be calculated.In addition, it is often the case that hundreds of branching Declare constraints are valid for the same log, thus making, again, the discovery results unreadable. In this paper, we address these problems from a theoretical angle. More specifically, we define the class of Target- Branched Declare constraints and investigate the formal properties it exhibits. Furthermore, we present a technique for the efficient discovery of compact Target-Branched Declare models. We discuss the merits of our work through an evaluation based on a prototypical implementation using both artificial and real-world event logs.
http://bit.ly/vmaks-chalet
VMAKS CHALET is everything you wanted in a home & more, speciously well designed as a private low-rise apartment surrounded by the beauty of nature to give you a quality of life. With each flat offering functional layout Excellent natural light, ventilation and privacy to the premium. specification, fixtures and finishes.
Michał Giera: Davy Jones i jego smartfon, czyli piractwo na rynku mobile.Mobile Trends
Piractwo ma swoją długą i bogatą historię na desktopie. Dziś zarówno podejście konsumentów, jak i twórców, jest zupełnie inne niż 5-15 lat temu. Jak to jednak wygląda na rynku mobile? Jakie nauki developerzy wyciągneli już z zachowań mobilnych piratów i jakich kroków możemy się spodziewać?
Look but don’t touch: On the impalpable bond between blockchain and processClaudio Di Ciccio
Slides of the keynote held at the BPM Blockchain Forum 2023, 13 September 2023, Utrecht, Netherlands.
Synopsis:
Multi-party business processes rely on the collaboration of various players in a decentralized setting. Blockchain technology can facilitate the automation of these processes, even in cases where trust among participants is limited. Transactions are stored in a ledger, a replica of which is retained by every node of the blockchain network. The operations saved thereby are thus publicly accessible, which benefits transparency, reliability, and persistence. Smart contracts can encode the system behavior agreed upon by the involved parties to define the behaviour of collaborative processes. Rule enforcement, traceability and non-repudiation are thus catered for, too. However, data, objects and services in the outer world are not directly accessible from within a blockchain execution evironment. On one hand, access to limited information hinders the adoption of programmable blockchains as an effective aid to process intelligence. On the other hand, transferring every bit of off-chain information on-chain is not only impractical but also undesirable, as this operation could violate typical confidentiality requirements in enterprise settings. In this talk, we discuss and explore approaches aimed at strengthening the bond between process and blockchain execution environments, balancing between knowledge sharing and secrecy preservation.
Measurement of Rule-based LTLf Declarative Process SpecificationsClaudio Di Ciccio
Slides of the paper presented at the 4th Int. Conference on Process Mining (ICPM 2022, Bolzano, Italy).
Synopsis:
The classical checking of declarative Linear Temporal Logic on Finite Traces (LTLf) specifications verifies whether conjunctions of sets of formulae are satisfied by collections of finite traces. The data on which the verification is conducted may be corrupted by a number of logging errors or execution deviations at the level of single elements within a trace. The ability to quantitatively assess the extent to which traces satisfy a process specification (and not only if they do so or not at all) is thus key, especially in process mining scenarios. Previous techniques proposed for this aim either require formulae to be extended with quantitative operators or cater to the coarse granularity of whole traces. In this paper, we propose a framework to devise probabilistic measures for declarative process specifications on traces at the level of events, inspired by association rule mining. Thereupon, we describe a technique that measures the degree of satisfaction of these specifications over bags of traces. To assess our approach, we conduct an evaluation with real-world data.
Blockchain and smart contracts: infrastructure and platformsClaudio Di Ciccio
An introductory presentation on the main concepts of blockchain technologies, with a special focus on the smart contracts. The slides supported the talk held at the Cyber 4.0 Seminar on Cyber 4.0 Seminar on “Blockchain and Smart Contracts: Concepts and applications” on 2021-03-03, virtually hosted by the Sapienza University of Rome for the Cyber 4.0 Competence Centre.
Extracting Event Logs for Process Mining from Data Stored on the BlockchainClaudio Di Ciccio
Presentation of the paper presented at the 2nd International Workshop on Security and Privacy-enhanced Business Process Management (SPBP’19), 2 September 2019, Vienna, Austria (pre-print available at https://easychair.org/publications/preprint/cW8l).
Abstract: The integration of business process management with blockchains across organisational borders provides a means to establish transparency of execution and auditing capabilities. To enable process analytics, though, non-trivial extraction and transformation tasks are necessary on the raw data stored in the ledger. In this paper, we describe our approach to retrieve process data from an Ethereum blockchain ledger and subsequently convert those data into an event log formatted according to the IEEE Extensible Event Stream (XES) standard. We show a proof-of-concept software artefact and its application on a data set produced by the smart contracts of a process execution engine stored on the public Ethereum blockchain network.
A blockchain can be defined as an immutable distributed ledger on which transactions exchanged between peers are recorded. Transactions are cryptographically signed and are meant to transfer digital commodities between parties. Lately, the blockchains have undergone a paradigm shift from mere electronic cash systems to a universal platform endowed with internal programming languages, on top of which decentralised applications can be built. That has been the turning point enabling the execution of inter-organisational business processes on blockchains.
In this talk, the concepts behind and around blockchains will be described, together with the current research and future directions on its usage as an infrastructure for business process management.
Blockchain based traceability of inter-organisational business processesClaudio Di Ciccio
Presentation of the paper entitled “Blockchain-based Traceability of Interorganisational Business Processes” (http://dx.doi.org/10.1007/978-3-319-94214-8_4), held at BMSD 2018, Vienna, Austria (http://www.is-bmsd.org/).
Abstract:
The blockchain technology opens up new opportunities for Business Process Management. This is mainly due to its unprecedented capability to let transactions be automatically executed and recorded by Smart Contracts in multi-peer environments, in a decentralised fashion and without central authoritative players to govern the workflow. In this way, blockchains also provide traceability. Traceability of information plays a pivotal role particularly in those supply chains where multiple parties are involved and rigorous criteria must be fulfilled to lead to a successful outcome. In this paper, we investigate how to run a business process in the context of a supply chain on a blockchain infrastructure so as to provide full traceability of its run-time enactment. Our approach retrieves information to trace process instances execution solely from the transactions written on-chain. To do so, hash-codes are reverseengineered based on the Solidity Smart Contract encoding of the generating process. We show the results of our investigation by means of an implemented software prototype, with a case study on the reportedly challenging context of the pharmaceutical supply chain.
Log-Based Understanding of Business Processes through Temporal Logic Query Ch...Claudio Di Ciccio
Process mining is a discipline that aims at discovering, monitoring and improving real-life processes by extracting knowledge from event logs. Process discovery and conformance checking are the two main process mining tasks. Process discovery techniques can be used to learn a process model from example traces in an event log, whereas the goal of conformance checking is to compare the observed behavior in the event log with the modeled behavior. In this paper, we propose an approach based on temporal logic query checking, which is in the middle between process discovery and conformance checking. It can be used to discover those LTL-based business rules that are valid in the log, by checking against the log a (user-defined) class of rules. The proposed approach is not limited to provide a boolean answer about the validity of a business rule in the log, but it rather provides valuable diagnostics in terms of traces in which the rule is satisfied (witnesses) and traces in which the rule is violated (counterexamples). We have implemented our approach as a proof of concept and conducted a wide experimentation using both synthetic and real-life logs.
Semantical Vacuity Detection in Declarative Process MiningClaudio Di Ciccio
Presentation of the paper entitled “Semantical Vacuity Detection in Declarative Process Mining”
(http://dx.doi.org/10.1007/978-3-319-45348-4_10), held at BPM 2016, Rio de Janeiro, Brazil (http://bpm2016.uniriotec.br/).
A large share of the literature on process mining based on declarative process modeling languages, like DECLARE, relies on the notion of constraint activation to distinguish between the case in which a process execution recorded in event data “vacuously” satisfies a constraint, or satisfies the constraint in an “interesting way”. This fine-grained indicator is then used to decide whether a candidate constraint supported by the analyzed event log is indeed relevant or not. Unfortunately, this notion of relevance has never been formally defined, and all the proposals existing in the literature use ad-hoc definitions that are only applicable to a pre-defined set of constraint patterns. This makes existing declarative process mining technique inapplicable when the target constraint language is extensible and may contain formulae that go beyond pre-defined patterns. In this paper, we tackle this hot, open challenge and show how the notion of constraint activation and vacuous satisfaction can be captured semantically, in the case of constraints expressed in arbitrary temporal logics over finite traces. We then extend the standard automata-based approach so as to incorporate relevance-related information. We finally report on an implementation and experimentation of the approach that confirms the advantages and feasibility of our solution.
Detecting Flight Trajectory Anomalies and Predicting Diversions in Freight Tr...Claudio Di Ciccio
Presentation of the paper entitled “Detecting Flight Trajectory Anomalies and Predicting Diversions in Freight Transportation”
(http://dx.doi.org/10.1016/j.dss.2016.05.004), held at EMISA 2016, Vienna, Austria (https://aic.ai.wu.ac.at/emisa2016/).
Abstract:
Timely identifying flight diversions is a crucial aspect of efficient multi-modal transportation. When an airplane diverts, logistics providers must promptly adapt their transportation plans in order to ensure proper delivery despite such an unexpected event. In practice, the different parties in a logistics chain do not exchange real-time information related to flights. This calls for a means to detect diversions that just requires publicly available data, thus being independent of the communication between different parties. The dependence on public data results in a challenge to detect anomalous behavior without knowing the planned flight trajectory. Our work addresses this challenge by introducing a prediction model that just requires information on an airplane’s position, velocity, and intended destination. This information is used to distinguish between regular and anomalous behavior. When an airplane displays anomalous behavior for an extended period of time, the model predicts a diversion. A quantitative evaluation shows that this approach is able to detect diverting airplanes with excellent precision and recall even without knowing planned trajectories as required by related research. By utilizing the proposed prediction model, logistics companies gain a significant amount of response time for these cases.
As Europe's leading economic powerhouse and the fourth-largest hashtag#economy globally, Germany stands at the forefront of innovation and industrial might. Renowned for its precision engineering and high-tech sectors, Germany's economic structure is heavily supported by a robust service industry, accounting for approximately 68% of its GDP. This economic clout and strategic geopolitical stance position Germany as a focal point in the global cyber threat landscape.
In the face of escalating global tensions, particularly those emanating from geopolitical disputes with nations like hashtag#Russia and hashtag#China, hashtag#Germany has witnessed a significant uptick in targeted cyber operations. Our analysis indicates a marked increase in hashtag#cyberattack sophistication aimed at critical infrastructure and key industrial sectors. These attacks range from ransomware campaigns to hashtag#AdvancedPersistentThreats (hashtag#APTs), threatening national security and business integrity.
🔑 Key findings include:
🔍 Increased frequency and complexity of cyber threats.
🔍 Escalation of state-sponsored and criminally motivated cyber operations.
🔍 Active dark web exchanges of malicious tools and tactics.
Our comprehensive report delves into these challenges, using a blend of open-source and proprietary data collection techniques. By monitoring activity on critical networks and analyzing attack patterns, our team provides a detailed overview of the threats facing German entities.
This report aims to equip stakeholders across public and private sectors with the knowledge to enhance their defensive strategies, reduce exposure to cyber risks, and reinforce Germany's resilience against cyber threats.
http://bit.ly/vmaks-chalet
VMAKS CHALET is everything you wanted in a home & more, speciously well designed as a private low-rise apartment surrounded by the beauty of nature to give you a quality of life. With each flat offering functional layout Excellent natural light, ventilation and privacy to the premium. specification, fixtures and finishes.
Michał Giera: Davy Jones i jego smartfon, czyli piractwo na rynku mobile.Mobile Trends
Piractwo ma swoją długą i bogatą historię na desktopie. Dziś zarówno podejście konsumentów, jak i twórców, jest zupełnie inne niż 5-15 lat temu. Jak to jednak wygląda na rynku mobile? Jakie nauki developerzy wyciągneli już z zachowań mobilnych piratów i jakich kroków możemy się spodziewać?
Look but don’t touch: On the impalpable bond between blockchain and processClaudio Di Ciccio
Slides of the keynote held at the BPM Blockchain Forum 2023, 13 September 2023, Utrecht, Netherlands.
Synopsis:
Multi-party business processes rely on the collaboration of various players in a decentralized setting. Blockchain technology can facilitate the automation of these processes, even in cases where trust among participants is limited. Transactions are stored in a ledger, a replica of which is retained by every node of the blockchain network. The operations saved thereby are thus publicly accessible, which benefits transparency, reliability, and persistence. Smart contracts can encode the system behavior agreed upon by the involved parties to define the behaviour of collaborative processes. Rule enforcement, traceability and non-repudiation are thus catered for, too. However, data, objects and services in the outer world are not directly accessible from within a blockchain execution evironment. On one hand, access to limited information hinders the adoption of programmable blockchains as an effective aid to process intelligence. On the other hand, transferring every bit of off-chain information on-chain is not only impractical but also undesirable, as this operation could violate typical confidentiality requirements in enterprise settings. In this talk, we discuss and explore approaches aimed at strengthening the bond between process and blockchain execution environments, balancing between knowledge sharing and secrecy preservation.
Measurement of Rule-based LTLf Declarative Process SpecificationsClaudio Di Ciccio
Slides of the paper presented at the 4th Int. Conference on Process Mining (ICPM 2022, Bolzano, Italy).
Synopsis:
The classical checking of declarative Linear Temporal Logic on Finite Traces (LTLf) specifications verifies whether conjunctions of sets of formulae are satisfied by collections of finite traces. The data on which the verification is conducted may be corrupted by a number of logging errors or execution deviations at the level of single elements within a trace. The ability to quantitatively assess the extent to which traces satisfy a process specification (and not only if they do so or not at all) is thus key, especially in process mining scenarios. Previous techniques proposed for this aim either require formulae to be extended with quantitative operators or cater to the coarse granularity of whole traces. In this paper, we propose a framework to devise probabilistic measures for declarative process specifications on traces at the level of events, inspired by association rule mining. Thereupon, we describe a technique that measures the degree of satisfaction of these specifications over bags of traces. To assess our approach, we conduct an evaluation with real-world data.
Blockchain and smart contracts: infrastructure and platformsClaudio Di Ciccio
An introductory presentation on the main concepts of blockchain technologies, with a special focus on the smart contracts. The slides supported the talk held at the Cyber 4.0 Seminar on Cyber 4.0 Seminar on “Blockchain and Smart Contracts: Concepts and applications” on 2021-03-03, virtually hosted by the Sapienza University of Rome for the Cyber 4.0 Competence Centre.
Extracting Event Logs for Process Mining from Data Stored on the BlockchainClaudio Di Ciccio
Presentation of the paper presented at the 2nd International Workshop on Security and Privacy-enhanced Business Process Management (SPBP’19), 2 September 2019, Vienna, Austria (pre-print available at https://easychair.org/publications/preprint/cW8l).
Abstract: The integration of business process management with blockchains across organisational borders provides a means to establish transparency of execution and auditing capabilities. To enable process analytics, though, non-trivial extraction and transformation tasks are necessary on the raw data stored in the ledger. In this paper, we describe our approach to retrieve process data from an Ethereum blockchain ledger and subsequently convert those data into an event log formatted according to the IEEE Extensible Event Stream (XES) standard. We show a proof-of-concept software artefact and its application on a data set produced by the smart contracts of a process execution engine stored on the public Ethereum blockchain network.
A blockchain can be defined as an immutable distributed ledger on which transactions exchanged between peers are recorded. Transactions are cryptographically signed and are meant to transfer digital commodities between parties. Lately, the blockchains have undergone a paradigm shift from mere electronic cash systems to a universal platform endowed with internal programming languages, on top of which decentralised applications can be built. That has been the turning point enabling the execution of inter-organisational business processes on blockchains.
In this talk, the concepts behind and around blockchains will be described, together with the current research and future directions on its usage as an infrastructure for business process management.
Blockchain based traceability of inter-organisational business processesClaudio Di Ciccio
Presentation of the paper entitled “Blockchain-based Traceability of Interorganisational Business Processes” (http://dx.doi.org/10.1007/978-3-319-94214-8_4), held at BMSD 2018, Vienna, Austria (http://www.is-bmsd.org/).
Abstract:
The blockchain technology opens up new opportunities for Business Process Management. This is mainly due to its unprecedented capability to let transactions be automatically executed and recorded by Smart Contracts in multi-peer environments, in a decentralised fashion and without central authoritative players to govern the workflow. In this way, blockchains also provide traceability. Traceability of information plays a pivotal role particularly in those supply chains where multiple parties are involved and rigorous criteria must be fulfilled to lead to a successful outcome. In this paper, we investigate how to run a business process in the context of a supply chain on a blockchain infrastructure so as to provide full traceability of its run-time enactment. Our approach retrieves information to trace process instances execution solely from the transactions written on-chain. To do so, hash-codes are reverseengineered based on the Solidity Smart Contract encoding of the generating process. We show the results of our investigation by means of an implemented software prototype, with a case study on the reportedly challenging context of the pharmaceutical supply chain.
Log-Based Understanding of Business Processes through Temporal Logic Query Ch...Claudio Di Ciccio
Process mining is a discipline that aims at discovering, monitoring and improving real-life processes by extracting knowledge from event logs. Process discovery and conformance checking are the two main process mining tasks. Process discovery techniques can be used to learn a process model from example traces in an event log, whereas the goal of conformance checking is to compare the observed behavior in the event log with the modeled behavior. In this paper, we propose an approach based on temporal logic query checking, which is in the middle between process discovery and conformance checking. It can be used to discover those LTL-based business rules that are valid in the log, by checking against the log a (user-defined) class of rules. The proposed approach is not limited to provide a boolean answer about the validity of a business rule in the log, but it rather provides valuable diagnostics in terms of traces in which the rule is satisfied (witnesses) and traces in which the rule is violated (counterexamples). We have implemented our approach as a proof of concept and conducted a wide experimentation using both synthetic and real-life logs.
Semantical Vacuity Detection in Declarative Process MiningClaudio Di Ciccio
Presentation of the paper entitled “Semantical Vacuity Detection in Declarative Process Mining”
(http://dx.doi.org/10.1007/978-3-319-45348-4_10), held at BPM 2016, Rio de Janeiro, Brazil (http://bpm2016.uniriotec.br/).
A large share of the literature on process mining based on declarative process modeling languages, like DECLARE, relies on the notion of constraint activation to distinguish between the case in which a process execution recorded in event data “vacuously” satisfies a constraint, or satisfies the constraint in an “interesting way”. This fine-grained indicator is then used to decide whether a candidate constraint supported by the analyzed event log is indeed relevant or not. Unfortunately, this notion of relevance has never been formally defined, and all the proposals existing in the literature use ad-hoc definitions that are only applicable to a pre-defined set of constraint patterns. This makes existing declarative process mining technique inapplicable when the target constraint language is extensible and may contain formulae that go beyond pre-defined patterns. In this paper, we tackle this hot, open challenge and show how the notion of constraint activation and vacuous satisfaction can be captured semantically, in the case of constraints expressed in arbitrary temporal logics over finite traces. We then extend the standard automata-based approach so as to incorporate relevance-related information. We finally report on an implementation and experimentation of the approach that confirms the advantages and feasibility of our solution.
Detecting Flight Trajectory Anomalies and Predicting Diversions in Freight Tr...Claudio Di Ciccio
Presentation of the paper entitled “Detecting Flight Trajectory Anomalies and Predicting Diversions in Freight Transportation”
(http://dx.doi.org/10.1016/j.dss.2016.05.004), held at EMISA 2016, Vienna, Austria (https://aic.ai.wu.ac.at/emisa2016/).
Abstract:
Timely identifying flight diversions is a crucial aspect of efficient multi-modal transportation. When an airplane diverts, logistics providers must promptly adapt their transportation plans in order to ensure proper delivery despite such an unexpected event. In practice, the different parties in a logistics chain do not exchange real-time information related to flights. This calls for a means to detect diversions that just requires publicly available data, thus being independent of the communication between different parties. The dependence on public data results in a challenge to detect anomalous behavior without knowing the planned flight trajectory. Our work addresses this challenge by introducing a prediction model that just requires information on an airplane’s position, velocity, and intended destination. This information is used to distinguish between regular and anomalous behavior. When an airplane displays anomalous behavior for an extended period of time, the model predicts a diversion. A quantitative evaluation shows that this approach is able to detect diverting airplanes with excellent precision and recall even without knowing planned trajectories as required by related research. By utilizing the proposed prediction model, logistics companies gain a significant amount of response time for these cases.
As Europe's leading economic powerhouse and the fourth-largest hashtag#economy globally, Germany stands at the forefront of innovation and industrial might. Renowned for its precision engineering and high-tech sectors, Germany's economic structure is heavily supported by a robust service industry, accounting for approximately 68% of its GDP. This economic clout and strategic geopolitical stance position Germany as a focal point in the global cyber threat landscape.
In the face of escalating global tensions, particularly those emanating from geopolitical disputes with nations like hashtag#Russia and hashtag#China, hashtag#Germany has witnessed a significant uptick in targeted cyber operations. Our analysis indicates a marked increase in hashtag#cyberattack sophistication aimed at critical infrastructure and key industrial sectors. These attacks range from ransomware campaigns to hashtag#AdvancedPersistentThreats (hashtag#APTs), threatening national security and business integrity.
🔑 Key findings include:
🔍 Increased frequency and complexity of cyber threats.
🔍 Escalation of state-sponsored and criminally motivated cyber operations.
🔍 Active dark web exchanges of malicious tools and tactics.
Our comprehensive report delves into these challenges, using a blend of open-source and proprietary data collection techniques. By monitoring activity on critical networks and analyzing attack patterns, our team provides a detailed overview of the threats facing German entities.
This report aims to equip stakeholders across public and private sectors with the knowledge to enhance their defensive strategies, reduce exposure to cyber risks, and reinforce Germany's resilience against cyber threats.
Chatty Kathy - UNC Bootcamp Final Project Presentation - Final Version - 5.23...John Andrews
SlideShare Description for "Chatty Kathy - UNC Bootcamp Final Project Presentation"
Title: Chatty Kathy: Enhancing Physical Activity Among Older Adults
Description:
Discover how Chatty Kathy, an innovative project developed at the UNC Bootcamp, aims to tackle the challenge of low physical activity among older adults. Our AI-driven solution uses peer interaction to boost and sustain exercise levels, significantly improving health outcomes. This presentation covers our problem statement, the rationale behind Chatty Kathy, synthetic data and persona creation, model performance metrics, a visual demonstration of the project, and potential future developments. Join us for an insightful Q&A session to explore the potential of this groundbreaking project.
Project Team: Jay Requarth, Jana Avery, John Andrews, Dr. Dick Davis II, Nee Buntoum, Nam Yeongjin & Mat Nicholas
Ensuring Model Consistency in Declarative Process Discovery
1. Ensuring Model Consistency in
Declarative Process Discovery
Claudio Di Ciccio, Fabrizio Maria Maggi, Marco Montali and Jan Mendling
13th International Conference on Business Process Management
Innsbruck, Austria
claudio.di.ciccio@wu.ac.at
17. Declarative process discovery
SEITE 17
?
Objective: understanding the
constraints that best define
the allowed behaviour of the
process behind the event log
18. Declarative modelling of
processes
Usage of constraints
“Open model”
Declare
state-of-the-art language
If A is performed,
B must be performed,
no matter if before or afterwards
(responded existence)
Whenever B is performed,
C must be performed afterwards
and B can not be repeated
until C is done
(alternate response)
SEITE 18
19. Declare:
existence templates
SEITE 19
Existence(n, A)
Activity A occurs at least n times in the process instance
BCAAC ✓ BCAAAC ✓ BCAC ✗ (for n = 2)
Absence(A)
Activity A does not occur in the process instance
BCC ✓ BCAC ✗
Absence(n+1, A)
Activity A occurs at most n+1 times in the process instance
BCAAC ✗ BCAC ✓ BCC ✓ (for n = 2)
Exactly(n, A)
Activity A occurs exactly n times in the process instance
BCAAC ✗ BCAAAC ✗ BCAC ✗ (for n = 2)
Init(A)
Activity A is the first to occur in each process instance
BCAAC ✗ ACAAAC ✓ BCC ✗
Absence(2, A) ≐ AtMostOne(A)
Existence(1, A) ≐ Participation(A)
21. Declare: Forward-unidirectional
relation constraint templates
RespondedExistence(A, B)
If A occurs in the process instance, then B occurs as well
CAC ✗ CAACB ✓
BCAC ✓ BCC ✓
Response(A, B)
If A occurs in the process instance, then B occurs after A
BCAAC ✗ CAACB ✓
CAC ✗ BCC ✓
AlternateResponse(A, B)
Each time A occurs in the process instance, then B occurs
afterwards, before A recurs
BCAAC ✗ CAACB ✗ CACB ✓
CABCA ✗ BCC ✓ CACBBAB ✓
ChainResponse(A, B)
Each time A occurs in the process instance, then B occurs
immediately afterwards
BCAAC ✗ BCAABC ✗ BCABABC ✓
Activation Target
22. Declare: Backward-unidirectional
relation constraint templates
RespondedExistence(B, A)
If B occurs in the process instance, then A occurs as well
CAC ✓ CAACB ✓
BCAC ✓ BCC ✗
Precedence(A, B)
B occurs in the process instance only if preceded by A
BCAAC ✗ CAACB ✓
CAC ✓ BCC ✓
AlternatePrecedence(A, B)
Each time B occurs in the process instance, it is preceded by A
and no other B can recur in between
BCAAC ✗ CAACB ✓ CACB ✓
CABCA ✓ BCC ✗ CACBAB ✓
ChainPrecedence(A, B)
Each time B occurs in the process instance, then B occurs
immediately beforehand
BCAAC ✗ BCAABC ✗ CABABCA ✓
Target Activation
23. Declare:
Coupling relation templates
CoExistence(A, B)
If B occurs in the process instance, then A occurs, and viceversa
CAC ✗ CAACB ✓
BCAC ✓ BCC ✗
Succession(A, B)
A occurs if and only if it is followed by B in the process instance
BCAAC ✗ CAACB ✓
CAC ✗ BCC ✗
AlternateSuccession(A, B)
A and B occur in the process instance if and only if the latter
follows the former, and they alternate each other in the trace
BCAAC ✗ CAACB ✗ CACB ✓
CABCA ✗ BCC ✗ CACBAB ✓
ChainSuccession(A, B)
A and B occur in the process instance if and only if the latter
immediately follows the former
BCAAC ✗ BCAABC ✗ CABABC ✓
Target Activation
Activation Target
24. Declare:
negative relation constraints
NotCoExistence(A, B)
A and B never occur together in the process instance
CAC ✓ CAACB ✗
BCAC ✗ BCC ✓
NotSuccession(A, B)
A can never occur before B in the process instance
BCAAC ✓ CAACB ✗
CAC ✓ BCC ✓
NotChainSuccession(A, B)
A and B occur in the process instance if and only if the latter
does not immediately follows the former
BCAAC ✓ BCAABC ✗ CBACBA ✓
Target Activation
Activation Target
26. Mining declarative processes
RespondedExistence(a,b) ?
RespondedExistence(a,c) ?
…
Response(a,b) ?
Response(a,c) ?
…
SEITE 26
• Support:
fraction of cases fulfilling the constraint
• Confidence:
support scaled by fraction of traces in
which the activation occurs
• Interest factor:
confidence scaled by fraction of traces in
which the target occurs
Support Conf. I.F.
32. From constraints-based model
to FSA
RespondedExistence(a,b)
RespondedExistence(a,c)
and
Response(a,b)
Response(a,c)
and
…
SEITE 32
[^a]*((a.*b.*)|(b.*a.*))*[^a]* [^a]*(a.*c)*[^a]*
Regular
Expression
Deterministic
Finite
State
Automaton
33. To be kept in mind
RespondedExistence(a,b)
RespondedExistence(a,c)
and
Response(a,b)
Response(a,c)
and
…
SEITE 33
[^a]*((a.*b.*)|(b.*a.*))*[^a]* [^a]*(a.*c)*[^a]*
Regular
Expression
Deterministic
Finite
State
Automaton
40. The problem
When support threshold is lower than 100%,
constraints can be valid through most of the log, though being in conflict
Example: an event log consists of two traces:
1. <a, b, a, b, a, b, c>
2. <a, b, a, b, a, c>
Support threshold: 0.7
• a is always the first
Init(a)
• c is always the last
End(c)
• In 6 cases over 8 (75%), a and c do not directly follow
each other
NotChainSuccession(a,c)
• In 5 cases over 7 (71.143%), b and c do not directly follow
each other
NotChainSuccession(b,c)
SEITE 40
41. The problem
When support threshold is lower than 100%,
constraints can be valid through most of the log, though being in conflict
Example: an event log consists of two traces:
1. <a, b, a, b, a, b, c>
2. <a, b, a, b, a, c>
Support threshold: 0.7
• a is always the first
Init(a)
• c is always the last
End(c)
• In 6 cases over 8 (75%), a and c do not directly follow
each other
NotChainSuccession(a,c)
• In 5 cases over 7 (71.143%), a and b do not directly follow
each other
NotChainSuccession(b,c)
Question: what can be done right before c?
inconsistency!
SEITE 41
42. The problem
When support threshold is lower than 100%,
constraints can be valid through most of the log, though being in conflict
How to trust a discovery algorithm that can return inconsistent models?
SEITE 42
44. The solution
Rationale:
1. How to find inconsistencies among constraints?
Use the automaton-based model for constraints
Do cross-product automata recognise the empty
language?
2. How to search the inconsistencies?
Exploit:
a) The product operation between automata
b) The hierarchy of Declare templates
Guideline:
Preserve the most meaningful constraints
SEITE 44
45. The algorithm /1
1. Divide the constraints
having a support of
100% from the rest
Those that have a
support of 100% cannot
contradict each other
In other words, we
consider them “safe”
SEITE 45
NotChainSuccession(a, c) 0.75 0.75 0.75
Response(a, b) 0.83 0.83 0.83
ChainSuccession(b, a) 0.72 0.72 0.72
ChainResponse(b, a) 0.80 0.80 0.80
ChainSuccession(a, b) 0.91 0.91 0.91
NotChainSuccession(b, c) 0.71 0.71 0.71
…
Init(a) 1.00 1.00 1.00
Participation(b) 1.00 1.00 1.00
AtMostOne(c) 1.00 1.00 1.00
End(c) 1.00 1.00 1.00
ChainPrecedence(a, b) 1.00 1.00 1.00
CoExistence(a, b) 1.00 1.00 1.00
…
46. The algorithm /2
2. Sort constraints having
a support of less than
100% (“unsafe”) by:
i. Support (desc.)
ii. Confidence (desc.)
iii. Interest Factor (desc.)
SEITE 46
Init(a) 1.00 1.00 1.00
Participation(b) 1.00 1.00 1.00
AtMostOne(c) 1.00 1.00 1.00
End(c) 1.00 1.00 1.00
ChainPrecedence(a, b) 1.00 1.00 1.00
CoExistence(a, b) 1.00 1.00 1.00
…
ChainSuccession(a, b) 0.91 0.91 0.91
Response(a, b) 0.83 0.83 0.83
ChainResponse(b, a) 0.80 0.80 0.80
NotChainSuccession(a, c) 0.75 0.75 0.75
ChainSuccession(b, a) 0.72 0.72 0.72
NotChainSuccession(b, c) 0.71 0.71 0.71
…
sort
47. The algorithm /3
3. Create the automaton
representing the safe
constraints, as the
product of the single
constraints’ automata
Initialise the
“product automaton”
SEITE 47
…
Init(a) Participation(b)
ChainPrecedence(a,b)
48. The algorithm /3
3. Create the automaton
representing the safe
constraints, as the
product of the single
constraints’ automata
Initialise the
“product automaton”
SEITE 48
49. The algorithm /4
For every unsafe-constraint
automaton, following the
order of step 2:
4. Intersect the product
automaton with the
unsafe constraint
SEITE 49
NotChainSuccession(a,c)
50. The algorithm /4
4. (…cnt)
If the result accepts only
an empty language:
discard it if no constraint
is higher in the hierarchy
relax the constraint
otherwise, and repeat
step 4.
Else, include the unsafe-
constraint in the list of
returned constraints,
and save the product
automaton
SEITE 50
…
NotChainSuccession(b,c)
51. The algorithm /4
4. Return the process
model made of:
safe constraints, and
unsafe constraints not
leading to automata
recognising empty
languages
SEITE 51
52. The algorithm: recap
SEITE 52
Init(a)
Participation(b)
AtMostOne(c)
End(c)
ChainPrecedence(a, b)
…
ChainSuccession(a, b)
Response(a, b)
ChainResponse(b, a)
NotChainSuccession(a, c)
ChainSuccession(b, a)
NotChainSuccession(b, c)
…
sort
…
…
1
53. The algorithm: recap
SEITE 53
Init(a)
Participation(b)
AtMostOne(c)
End(c)
ChainPrecedence(a, b)
…
ChainSuccession(a, b)
Response(a, b)
ChainResponse(b, a)
NotChainSuccession(a, c)
ChainSuccession(b, a)
NotChainSuccession(b, c)
…
sort
…
…
1
2
54. Conclusion
Which were the conflicting constraints in the log?
What is more in the paper
Limitations and future work
56. Which were the conflicting
constraints in the log?
1. NotSuccession(send meeting, organize agenda)
2. NotChainSuccession(send draft, send deliverable)
3. Succession(send draft, submit report)
SEITE 56
58. Conclusions, limitations and
future work
We have presented an algorithm that automatically finds
inconsistencies in a mined Declare model (more in the paper)
The checks are purely based on operations over automata
Optimisations exploit Declare semantics
http://github.com/cdc08x/minerful
Limitations:
The order in which the constraints are checked deeply affects the returned
result
Performances are heavily affected by the interplay of constraints
Future work:
Application of the technique over mixed declarative-imperative models
User-defined criteria for constraints sorting/selection
Heuristics for a more efficient exploration of the search space are currently
under investigation
http://www.promtools.org/prom6/nightly
SEITE 58
59. Ensuring Model Consistency in
Declarative Process Discovery
Claudio Di Ciccio, Fabrizio Maria Maggi, Marco Montali and Jan Mendling
13th International Conference on Business Process Management
Innsbruck, Austria
claudio.di.ciccio@wu.ac.at
60. Ensuring Model Consistency in
Declarative Process Discovery
Claudio Di Ciccio, Fabrizio Maria Maggi, Marco Montali and Jan Mendling
13th International Conference on Business Process Management
Innsbruck, Austria
Extra slides deck
61. The application of the method
to minimise the model
Rationale:
1. How to find redundancies among constraints?
Use the automaton-model correspondence
Same language recognised after the product?
Main difference with the inconsistency-
checking algorithm
Constraints having support 100% are checked for
redundancies
More details in the paper
SEITE 61
63. The algorithm /4
4. Return the process
model made of:
safe constraints, and
unsafe constraints not
leading to automata
recognising empty
languages
SEITE 63
<a, b, a, b, a, b, c>
<a, b, a, b, a, c>