Article
Version 1
Preserved in Portico This version is not peer-reviewed
Quickening Data-Aware Conformance Checking through Temporal Algebras
Version 1
: Received: 11 January 2023 / Approved: 13 January 2023 / Online: 13 January 2023 (11:07:20 CET)
A peer-reviewed article of this Preprint also exists.
Bergami, G.; Appleby, S.; Morgan, G. Quickening Data-Aware Conformance Checking through Temporal Algebras. Information 2023, 14, 173. Bergami, G.; Appleby, S.; Morgan, G. Quickening Data-Aware Conformance Checking through Temporal Algebras. Information 2023, 14, 173.
Abstract
This paper extends our seminal paper on KnoBAB for efficient Conformance Checking
computations performed on top of a customised relational model. After defining our proposed
temporal algebra for temporal queries (xtLTLf ), we show that this can express existing temporal
languages over finite and non-empty traces such as LTLf . This paper also proposes a parallelisation
strategy for such queries thus reducing conformance checking into an embarrassingly parallel
problem leading to super-linear speed up. This paper also presents how a single xtLTLf operator (or
even entire sub-expressions) might be efficiently implemented via different algorithms thus paving
the way to future algorithmic improvements. Finally, our benchmarks remark that our proposed
implementation of xtLTLf (KnoBAB) outperforms state-of-the-art conformance checking software
running on LTLf logic, be it data or dateless.
Keywords
Logic Artificial Intelligence; Knowledge Bases; Query Plan; Temporal Logic; Conformance Checking; Temporal Data Mining; Intraquery Parallelism
Subject
Computer Science and Mathematics, Computer Science
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
