Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
BPMN2Constraints: breaking down BPMN diagrams into declarative process query constraints
Umeå University, Faculty of Science and Technology, Department of Computing Science. SAP Signavio, Berlin, Germany.
SAP Signavio, Berlin, Germany; University of Mannheim, Mannheim, Germany.
Umeå University, Faculty of Science and Technology, Department of Computing Science. SAP Signavio, Berlin, Germany. (Interactive and Intelligent Systems Group)ORCID iD: 0000-0002-6458-2252
2023 (English)In: BPM 2023 best dissertation award, doctoral consortium, and demonstration & resources forum: proceedings of the Best dissertation award, doctoral consortium, and demonstration & resources forum at BPM  2023, co-located with 21st International conference on business process management (BPM 2023) / [ed] Dirk Fahland; Andrés Jiménez Ramírez; Akhil Kumar; Jan Mendling; Brian Pentland; Stefanie Rinderle-Ma; Tijs Slaats; Johan Versendaal; Barbara Weber; Mathias Weske; Karol Winter, Aachen: Aachen University , 2023, p. 137-141Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents BPMN2Constraints, a tool that compiles BPMN diagrams into sets of declarative constraints that can then, for example, be used for conformance checking. Notably, BPMN2Constraints does not rely on Petri net replay for generating the constraints; by generating constraints directly from a control flow graph extracted from the BPMN model, the tool avoids indirection. BPMN2Constraints can generate constraints in several languages: DECLARE, finite-trace linear temporal logic, and SIGNAL, a proprietary process querying language.

Place, publisher, year, edition, pages
Aachen: Aachen University , 2023. p. 137-141
Series
CEUR Workshop Proceedings, ISSN 1613-0073 ; 3469
Keywords [en]
Business process management, Declarative constraints, Conformance checking, Process querying
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:umu:diva-214023Scopus ID: 2-s2.0-85172014722OAI: oai:DiVA.org:umu-214023DiVA, id: diva2:1793814
Conference
BPM 2023, 21st International Conference on Business Process Management, Utrecht, the Netherlands, September 11-15, 2023
Available from: 2023-09-03 Created: 2023-09-03 Last updated: 2024-06-25Bibliographically approved

Open Access in DiVA

fulltext(615 kB)246 downloads
File information
File name FULLTEXT01.pdfFile size 615 kBChecksum SHA-512
f7541a894bf5a2a1c915f46d3332c153730c2546ab77c5778489bc811292f6d3de73194d05fc0c6ed2695e2b6a25c91f7ba4a82b54b140458893922619b64be9
Type fulltextMimetype application/pdf

Other links

ScopusBPM 2023 Proceedings

Authority records

Bergman, ArvidKampik, Timotheus

Search in DiVA

By author/editor
Bergman, ArvidKampik, Timotheus
By organisation
Department of Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 249 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 704 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf