Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Logs

Zaki, Nesma M.; Helal, Iman M. A.; Hassanein, Ehab E.; Awad, Ahmed

doi:10.1007/978-3-031-21595-7_11

Cited by 3 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite the recent attempt at representing logs as temporal graphs [55], the aforementioned is still a desideratum, as no graph temporal operator for expressing formal verification tasks is currently known. Differently from the previously pursued approach [56], this will then require us to define tailored temporal operators for graph query languages similarly to xtLTL f .…”

Section: Discussionmentioning

confidence: 99%

Streamlining Temporal Formal Verification over Columnar Databases

Bergami

2024

Information

View full text Add to dashboard Cite

Recent findings demonstrate how database technology enhances the computation of formal verification tasks expressible in linear time logic for finite traces (LTLf). Human-readable declarative languages also help the common practitioner to express temporal constraints in a straightforward and accessible language. Notwithstanding the former, this technology is in its infancy, and therefore, few optimization algorithms are known for dealing with massive amounts of information audited from real systems. We, therefore, present four novel algorithms subsuming entire LTLf expressions while outperforming previous state-of-the-art implementations on top of KnoBAB, thus postulating the need for the corresponding, leading to the formulation of novel xtLTLf-derived algebraic operators.

show abstract

Section: Discussionmentioning

confidence: 99%

Streamlining Temporal Formal Verification over Columnar Databases

Bergami

2024

Information

View full text Add to dashboard Cite

show abstract

Cross-Instance Regulatory Compliance Checking of Business Process Event Logs

van Beest,

Groefsema,

Cryer

et al. 2023

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Quickening Data-Aware Conformance Checking through Temporal Algebras

2023

View full text Add to dashboard Cite

A temporal model describes processes as a sequence of observable events characterised by distinguishable actions in time. Conformance checking allows these models to determine whether any sequence of temporally ordered and fully-observable events complies with their prescriptions. The latter aspect leads to Explainable and Trustworthy AI, as we can immediately assess the flaws in the recorded behaviours while suggesting any possible way to amend the wrongdoings. Recent findings on conformance checking and temporal learning lead to an interest in temporal models beyond the usual business process management community, thus including other domain areas such as Cyber Security, Industry 4.0, and e-Health. As current technologies for accessing this are purely formal and not ready for the real world returning large data volumes, the need to improve existing conformance checking and temporal model mining algorithms to make Explainable and Trustworthy AI more efficient and competitive is increasingly pressing. To effectively meet such demands, this paper offers KnoBAB, a novel business process management system for efficient Conformance Checking computations performed on top of a customised relational model. This architecture was implemented from scratch after following common practices in the design of relational database management systems. 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 highlight that our proposed implementation of xtLTLf (KnoBAB) outperforms state-of-the-art conformance checking software running on LTLf logic.

show abstract

Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Logs

Cited by 3 publications

References 19 publications

Streamlining Temporal Formal Verification over Columnar Databases

Streamlining Temporal Formal Verification over Columnar Databases

Cross-Instance Regulatory Compliance Checking of Business Process Event Logs

Quickening Data-Aware Conformance Checking through Temporal Algebras

Contact Info

Product

Resources

About