Analyzing process models using graph reduction techniques

doi:10.1016/S0306-4379(00)00012-0

Information Systems

Volume 25, Issue 2, April 2000, Pages 117-134

https://doi.org/10.1016/S0306-4379(00)00012-0 Get rights and content

Abstract

The foundation of a process model lies in its structural specifications. Using a generic process modeling language for workflows, we show how a structural specification may contain deadlock and lack of synchronization conflicts that could compromise the correct execution of workflows. In general, identification of such conflicts is a computationally complex problem and requires development of effective algorithms specific for the target modeling language. We present a visual verification approach and algorithm that employs a set of graph reduction rules to identify structural conflicts in process models for the given workflow modeling language. We also provide insights into the correctness and complexity of the reduction process. Finally, we show how the reduction algorithm may be used to count possible instance subgraphs of a correct process model. The main contribution of the paper is a new technique for satisfying well-defined correctness criteria in process models.

References (18)

W.M.P. van der Aalst
Verification of workflow nets
W.M.P. van der Aalst
The application of Petri nets to workflow management
The Journal of Circuits, Systems and Computers
(1998)
M. Reichert et al.
ADEPTflex — Supporting dynamic changes of workflow without loosing control
Journal of Intelligent Information Systems (JIIS), Special Issue on Workflow and Process Management
(1998)
S. Carlsen
Conceptual Modeling and Composition of Flexible Workflow Models
F. Casati et al.
Conceptual modeling of workflows
C.A. Ellis et al.
Modelling and enactment of workflow systems
D. Georgakopoulos et al.
An overview of workflow management: from process modeling to workflow automation infrastructure
Journal on Distributed and Parallel Databases
(1995)
A.H.M ter Hofstede et al.
Verification problems in conceptual workflow specifications
Data & Knowledge Engineering
(1998)

There are more references available in the full text version of this article.

Cited by (396)

Core-shell equivalent reactor network model to bridging CFD and process simulations of a fluidized bed reactor
2024, Chemical Engineering Science
Equivalent reactor network (ERN) is expected to narrow the gap between the computational fluid dynamics (CFD) and process simulations of a fluidized bed reactor (FBR). In view of this, a novel CFD-based core–shell ERN framework is proposed, where the core compartment is represented by a variable cross-section PFR (vPFR) and shell zones are simulated by CSTRs. The CFD simulation indicates that the gas phase flow in a propane dehydrogenation (PDH) FBR deviates significantly from the ideal plug-flow. The developed core–shell ERN is reliable to reproduce the non-ideal flow. With the process model integrating the core–shell ERN, the PDH reactor performance and process efficiency are evaluated. Process defects are found mainly in the heat exchange section because of the largest lost work (i.e., 45.34 %) and lowest second-law efficiency (i.e., 20.75 %). Overall, the core–shell ERN is capable of bridging CFD and process simulations of an FBR and detecting process weakness.
Malicious webshell family dataset for webshell multi-classification research
2024, Visual Informatics
Malicious webshells currently present tremendous threats to cloud security. Most relevant studies and open webshell datasets consider malicious webshell defense as a binary classification problem, that is, identifying whether a webshell is malicious or benign. However, a fine-grained multi-classification is urgently needed to enable precise responses and active defenses on malicious webshell threats. This paper introduces a malicious webshell family dataset named MWF to facilitate webshell multi-classification researches. This dataset contains 1359 malicious webshell samples originally obtained from the cloud servers of Alibaba Cloud. Each of them is provided with a family label. The samples of the same family generally present similar characteristics or behaviors. The dataset has a total of 78 families and 22 outliers. Moreover, this paper introduces the human–machine collaboration process that is adopted to remove benign or duplicate samples, address privacy issues, and determine the family of each sample. This paper also compares the distinguished features of the MWF dataset with previous datasets and summarizes the potential applied areas in cloud security and generalized sequence, graph, and tree data analytics and visualization.
BPEL process defects prediction using multi-objective evolutionary search
2023, Journal of Systems and Software
Web services are becoming increasingly popular technologies for modern organizations to improve their cooperation and collaboration through building new software systems by composing pre-built services. Such services are typically composed and executed through BPEL (Business Process Execution Language) processes. Like any other software artifact, such processes are frequently changed to add new or modify existing functionalities or adapt to environmental changes. However, poorly planned changes may introduce BPEL process design defects known as anti-patterns or defects. The presence of defects often leads to a regression in software quality. In this paper, we introduce an automated approach to predict the presence of defects in BPEL code using Multi-Objective Genetic Programming (MOGP). Our approach consists of learning from real-world instances of each service-based business process defect (i.e., anti-pattern) type to infer prediction rules based on the combinations of process metrics and their associated threshold values. We evaluate our approach based on a dataset of 178 real-world business processes that belong to various application domains, and a variety of BPEL process defect types such as data flow and portability defects. The statistical analysis of the achieved results shows the effectiveness of our approach in identifying defects compared with state-of-the-art techniques with a median accuracy of 91%.
Fast incremental reconfiguration of dynamic time-sensitive networks at runtime
2023, Computer Networks
Static configurations in Time-sensitive Networking (TSN) using the Time-aware Shaper allow precise calculations of deterministic, tight bandwidth and latency guarantees for real-time industrial application streams. However, this static configuration makes introducing flexible changes to a TSN system at runtime very hard. Scenarios of adaptive TSN networks envision that the network configuration evolves with time in accordance with anticipated changes, such as the dynamicity of machine formations and machine reconfigurations.
In this paper, we propose a notion of flexibility of scheduler configurations along a network path that facilitates introducing changes to TSN network configurations at runtime. Based on this notion, we develop and analyze algorithms to incrementally reconfigure TSN using the Time-Aware Shaper. These reconfigurations include determining the admissibility of new or changed streams that may possess individual deadlines.
Graph reductions and partitioning heuristics for multicore DAG scheduling
2022, Journal of Systems Architecture
The design of cyber–physical systems (CPSs) is facing the explosion of new functionalities requiring increased computation capacities and, thus, the introduction of multi-core processors. Moreover, some functionalities may impose precedence constraints between the programs implementing these new functionalities. While important effort has been dedicated to the scheduling of precedence constraints tasks on multi-core processors, existing work considers either partitioned scheduling for a single precedence graph defining precedence constraints between sub-tasks, or global scheduling policies. In this paper, we consider partitioned scheduling for multiple precedence graphs defining precedence constraints between tasks. We propose a partitioning heuristic that minimizes communication delays while maximizing sub-tasks parallelism. We also propose to decrease the complexity of existing schedulability analysis by providing appropriate graph reductions.
Process model abstraction for rapid comprehension of complex business processes
2022, Information Systems
Business process management has been widely adopted by many organizations, resulting in the accumulation of large collections of process models. The majority of these models are rather large and complex. Even though such models constitute a great source of knowledge, they cannot be easily understood by all process stakeholders. Process model abstraction techniques have been proven effective in generating easy to comprehend, high-level views on business process models; thus, such techniques change the way that detailed process models may be utilized within an organization. Although much attention has been given to abstract activities of process models, to the best of our knowledge, there are no research works that deliver abstract process model views, by considering as candidates for abstraction not only activities but also other process model elements. In this paper, we present an abstraction approach that simplifies existing process models by focusing not only on the abstraction of activities, but also on the abstraction of data, roles, messages and artifacts. The proposed approach exploits both model structure and element properties, while it is grounded on a set of abstraction rules. A prototype tool has been implemented as a proof of concept; this tool has been used for validating the proposed approach by automatically applying the suggested abstraction rules to different sets of real-world process models. A number of process stakeholders have also been involved in this validation. Thus, it is empirically proved that the presented work is an effective process model abstraction method that increases the usability of complex business process models, as it enables their rapid comprehension by process stakeholders.

View all citing articles on Scopus

View full text

Analyzing process models using graph reduction techniques

Abstract

Verification of workflow nets

The application of Petri nets to workflow management

The Journal of Circuits, Systems and Computers

ADEPTflex — Supporting dynamic changes of workflow without loosing control

Journal of Intelligent Information Systems (JIIS), Special Issue on Workflow and Process Management

Conceptual Modeling and Composition of Flexible Workflow Models

Conceptual modeling of workflows

Modelling and enactment of workflow systems

An overview of workflow management: from process modeling to workflow automation infrastructure

Journal on Distributed and Parallel Databases

Verification problems in conceptual workflow specifications

Data & Knowledge Engineering