A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems

• URL: http://arxiv.org/abs/2311.05243v7
• Date: Fri, 04 Oct 2024 14:47:53 GMT
• Title: A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems
• Authors: Tim Kräuter, Adrian Rutle, Harald König, Yngve Lamo,
• Abstract summary: We propose a formalization of the execution semantics of BPMN. Our approach is based on a higher-order transformation from BPMN models to graph transformation systems. To show the capabilities of our approach, we implemented it as an open-source web-based tool.
• Score: 1.0624606551524207
• License:
• Abstract: The Business Process Modeling Notation (BPMN) is a widely used standard notation for defining intra- and inter-organizational workflows. However, the informal description of the BPMN execution semantics leads to different interpretations of BPMN elements and difficulties in checking behavioral properties. In this article, we propose a formalization of the execution semantics of BPMN that, compared to existing approaches, covers more BPMN elements while also facilitating property checking. Our approach is based on a higher-order transformation from BPMN models to graph transformation systems. To show the capabilities of our approach, we implemented it as an open-source web-based tool.

Related papers

• DEMO enhanced BPMN [0.0]
  BPMN suffers from a lack of formal semantics, ambiguity, and limitations in modeling multi-party collaborations. A novel approach combining the rigor of DEMO's transaction patterns with the more practical, widely adopted BPMN framework is proposed and demonstrated. We argue that this combination enriches the modeling of business processes, providing a more coherent and reliable tool for both practitioners and researchers.
  arXiv  Detail & Related papers  (2024-09-25T11:43:29Z)
• A Step Towards a Universal Method for Modeling and Implementing Cross-Organizational Business Processes [0.0]
  This study lays the groundwork for more accurate and unified business process model executions. It describes the development of a prototype translator that converts specific BPMN elements into a format compatible with PASS. These models are then transformed into source code and executed in a bespoke workflow environment.
  arXiv  Detail & Related papers  (2024-06-18T06:19:44Z)
• Deep Stochastic Processes via Functional Markov Transition Operators [59.55961312230447]
  We introduce a new class of Processes (SPs) constructed by stacking sequences of neural parameterised Markov transition operators in function space. We prove that these Markov transition operators can preserve the exchangeability and consistency of SPs.
  arXiv  Detail & Related papers  (2023-05-24T21:15:23Z)
• MEAformer: Multi-modal Entity Alignment Transformer for Meta Modality Hybrid [40.745848169903105]
  Multi-modal entity alignment (MMEA) aims to discover identical entities across different knowledge graphs. MMEA algorithms rely on KG-level modality fusion strategies for multi-modal entity representation. This paper introduces MEAformer, a multi-modal entity alignment transformer approach for meta modality hybrid.
  arXiv  Detail & Related papers  (2022-12-29T20:49:58Z)
• Autoregressive Structured Prediction with Language Models [73.11519625765301]
  We describe an approach to model structures as sequences of actions in an autoregressive manner with PLMs. Our approach achieves the new state-of-the-art on all the structured prediction tasks we looked at.
  arXiv  Detail & Related papers  (2022-10-26T13:27:26Z)
• Guiding the PLMs with Semantic Anchors as Intermediate Supervision: Towards Interpretable Semantic Parsing [57.11806632758607]
  We propose to incorporate the current pretrained language models with a hierarchical decoder network. By taking the first-principle structures as the semantic anchors, we propose two novel intermediate supervision tasks. We conduct intensive experiments on several semantic parsing benchmarks and demonstrate that our approach can consistently outperform the baselines.
  arXiv  Detail & Related papers  (2022-10-04T07:27:29Z)
• Relational Action Bases: Formalization, Effective Safety Verification, and Invariants (Extended Version) [67.99023219822564]
  We introduce the general framework of relational action bases (RABs) RABs generalize existing models by lifting both restrictions. We demonstrate the effectiveness of this approach on a benchmark of data-aware business processes.
  arXiv  Detail & Related papers  (2022-08-12T17:03:50Z)
• BPMN4sML: A BPMN Extension for Serverless Machine Learning. Technology Independent and Interoperable Modeling of Machine Learning Workflows and their Serverless Deployment Orchestration [0.0]
  Machine learning (ML) continues to permeate all layers of academia, industry and society. Business Process Model and Notation (BPMN) is widely accepted and applied. BPMN is short of specific support to represent machine learning. We introduce BPMN4sML (BPMN for serverless machine learning)
  arXiv  Detail & Related papers  (2022-08-02T10:36:00Z)
• A formalisation of BPMN in Description Logics [11.550524384837892]
  This paper provides a clear semantic formalisation of the structural components of the Business Process Modelling Notation (BPMN) The development of the ontology was guided by the description of the complete set of BPMN Element Attributes and Types contained in Annex B of the BPMN specifications.
  arXiv  Detail & Related papers  (2021-09-22T13:17:28Z)
• CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT (Extended Version) [62.96267257163426]
  We introduce the CoCoMoT (Computing Conformance Modulo Theories) framework. First, we show how SAT-based encodings studied in the pure control-flow setting can be lifted to our data-aware case. Second, we introduce a novel preprocessing technique based on a notion of property-preserving clustering.
  arXiv  Detail & Related papers  (2021-03-18T20:22:50Z)
• SurVAE Flows: Surjections to Bridge the Gap between VAEs and Flows [78.77808270452974]
  SurVAE Flows is a modular framework for composable transformations that encompasses VAEs and normalizing flows. We show that several recently proposed methods, including dequantization and augmented normalizing flows, can be expressed as SurVAE Flows.
  arXiv  Detail & Related papers  (2020-07-06T13:13:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.