Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

Upper-Bounded Model Checking for Declarative Process Models

Title data

Schützenmeier, Nicolai ; Käppel, Martin ; Petter, Sebastian ; Jablonski, Stefan:
Upper-Bounded Model Checking for Declarative Process Models.
In: Serral, Estefania ; Stirnas, Janis ; Jolita, Ralyté ; Jānis, Grabis (ed.): The Practice of Enterprise Modeling. - Cham : Springer International Publishing , 2021 . - pp. 195-211 . - (Lecture Notes in Business Information Processing ; 432 )
ISBN 978-3-030-91279-6
DOI: https://doi.org/10.1007/978-3-030-91279-6_14

Official URL: Volltext

Abstract in another language

Declarative process modelling languages like Declare focus on describing a process by restrictions over the behaviour, which must be satisified throughout process execution. Although this paradigm allows more flexibility, it has been shown that such models are often hard to read and understand,which affects their modelling, execution and maintenance in a negative way. A larger degree of flexibility leads to a multitude of different process models that describe the same process. Often it is difficult for the modeller to keep the model as simple as possible without over- or underspecification. Hence, model checking, especially comparing declarative process models on equality becomes an important task. In this paper, we determine and prove a theoretical upper bound for the trace length up to which the process executions of Declare models must be compared, to decide with certainty whether two process models are equal or not.

Further data

Item Type: Article in a book
Refereed: Yes
Keywords: Linear temporal logic; Model checking; Declarative process management
Institutions of the University: Faculties > Faculty of Mathematics, Physics und Computer Science
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science > Chair Applied Computer Science IV
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science > Chair Applied Computer Science IV > Chair Applied Computer Science IV - Univ.-Prof. Dr.-Ing. Stefan Jablonski
Result of work at the UBT: Yes
DDC Subjects: 000 Computer Science, information, general works > 004 Computer science
Date Deposited: 16 Nov 2021 08:59
Last Modified: 16 Nov 2021 08:59
URI: https://eref.uni-bayreuth.de/id/eprint/67840