A formalisation of BPMN in Description Logics
- URL: http://arxiv.org/abs/2109.10716v1
- Date: Wed, 22 Sep 2021 13:17:28 GMT
- Title: A formalisation of BPMN in Description Logics
- Authors: Chiara Ghidini, Marco Rospocher, Luciano Serafini
- Abstract summary: 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.
- Score: 11.550524384837892
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this paper we present a textual description, in terms of Description
Logics, of the BPMN Ontology, which provides a clear semantic formalisation of
the structural components of the Business Process Modelling Notation (BPMN),
based on the latest stable BPMN specifications from OMG [BPMN Version 1.1 --
January 2008]. 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.
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) - Document Structure in Long Document Transformers [64.76981299465885]
Long documents often exhibit structure with hierarchically organized elements of different functions, such as section headers and paragraphs.
Despite the omnipresence of document structure, its role in natural language processing (NLP) remains opaque.
Do long-document Transformer models acquire an internal representation of document structure during pre-training?
How can structural information be communicated to a model after pre-training, and how does it influence downstream performance?
arXiv Detail & Related papers (2024-01-31T08:28:06Z) - A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems [1.0624606551524207]
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.
arXiv Detail & Related papers (2023-11-09T09:55:10Z) - 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) - 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) - Explainability in Process Outcome Prediction: Guidelines to Obtain
Interpretable and Faithful Models [77.34726150561087]
We define explainability through the interpretability of the explanations and the faithfulness of the explainability model in the field of process outcome prediction.
This paper contributes a set of guidelines named X-MOP which allows selecting the appropriate model based on the event log specifications.
arXiv Detail & Related papers (2022-03-30T05:59:50Z) - CoPHE: A Count-Preserving Hierarchical Evaluation Metric in Large-Scale
Multi-Label Text Classification [70.554573538777]
We argue for hierarchical evaluation of the predictions of neural LMTC models.
We describe a structural issue in the representation of the structured label space in prior art.
We propose a set of metrics for hierarchical evaluation using the depth-based representation.
arXiv Detail & Related papers (2021-09-10T13:09:12Z) - A conditional, a fuzzy and a probabilistic interpretation of
self-organising maps [0.0]
We establish a link between preferential semantics for description logics and self-organising maps.
We show that a concept-wise multipreference semantics can be used to provide a logical interpretation of SOMs.
arXiv Detail & Related papers (2021-03-11T18:31:00Z) - Document-level Neural Machine Translation with Document Embeddings [82.4684444847092]
This work focuses on exploiting detailed document-level context in terms of multiple forms of document embeddings.
The proposed document-aware NMT is implemented to enhance the Transformer baseline by introducing both global and local document-level clues on the source end.
arXiv Detail & Related papers (2020-09-16T19:43:29Z) - Structure of Resource Theory of Block Coherence [0.0]
We introduce the notion of Block Incoherent Operations (BIO), Strictly Block Incoherent Operations (SBIO) and Physically Block Incoherent Operations (PBIO)
A dilation theorem corresponding to SBIO has been introduced to enlighten the proper physical interpretation of this operation.
arXiv Detail & Related papers (2019-08-05T22:10:25Z)
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.