Keyword-Based Search of Workflow Fragments and Their Composition

Belhajjame, Khalid; Grigori, Daniela; Harmassi, Mariem; Yahia, Manel Ben

doi:10.1007/978-3-319-59268-8_4

Search citation statements

Order By: Relevance

Paper Sections

Select...

Applying Fsm To Workflow Net Mining1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2023

Publication Types

Select...

Book3

Other1

Article1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, there hasn't been work on mining general Petri nets such as C/E nets directly from the process data. With the development of process mining techniques in Petri net, FSM has been adapted successfully to mining frequent subnets from workflow nets [20,21,6,4,8,15,18,47]. The idea of applying FSM to workflow subnet mining has been extensively studied.…”

Section: Applying Fsm To Workflow Net Miningmentioning

confidence: 99%

PSpan:Mining Frequent Subnets of Petri Nets

Lu,

Zhang

2021

Preprint

View full text Add to dashboard Cite

This paper proposes for the first time an algorithm PSpan for mining frequent complete subnets from a set of Petri nets. We introduced the concept of complete subnets and the net graph representation. PSpan transforms Petri nets in net graphs and performs sub-net graph mining on them, then transforms the results back to frequent subnets. PSpan follows the pattern growth approach and has similar complexity like gSpan in graph mining. Experiments have been done to confirm PSpan's reliability and complexity. Besides C/E nets, it applies also to a set of other Petri net subclasses.

show abstract