Automaton-based comparison of Declare process models

Titelangaben

Schützenmeier, Nicolai ; Käppel, Martin ; Ackermann, Lars ; Jablonski, Stefan ; Petter, Sebastian:
Automaton-based comparison of Declare process models.
In: Software and Systems Modeling. Bd. 22 (2023) . - S. 667-685.
ISSN 1619-1374
DOI der Verlagsversion: https://doi.org/10.1007/s10270-022-01069-y

Volltext

	Format: PDF Name: s10270-022-01069-y.pdf Version: Veröffentlichte Version Verfügbar mit der Lizenz Creative Commons BY 4.0: Namensnennung
	Download (1MB)

Abstract

The Declare process modeling language has been established within the research community for modeling so-called flexible processes. Declare follows the declarative modeling paradigm and therefore guarantees flexible process execution. For several reasons, declarative process models turned out to be hard to read and comprehend. Thus, it is also hard to decide whether two process models are equal with respect to their semantic meaning, whether one model is completely contained in another one or how far two models overlap. In this paper, we follow an automaton-based approach by transforming Declare process models into finite state automatons and applying automata theory for solving this issue.