TY - GEN
T1 - There and Back Again
T2 - PETRI NETS 2023: Application and Theory of Petri Nets and Concurrency
AU - Barenholz, Daniël
AU - Montali, Marco
AU - Polyvyanyy, Artem
AU - Reijers, Hajo
AU - Rivkin, Andrey
AU - van der Werf, Jan Martijn
N1 - Funding Information:
Artem Polyvyanyy was in part supported by the Australian Research Council project DP220101516.
Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023
Y1 - 2023
N2 - A process discovery algorithm aims to construct a model from data generated by historical system executions such that the model describes the system well. Consequently, one desired property of a process discovery algorithm is rediscoverability, which ensures that the algorithm can construct a model that is behaviorally equivalent to the original system. A system often simultaneously executes multiple processes that interact through object manipulations. This paper presents a framework for developing process discovery algorithms for constructing models that describe interacting processes based on typed Jackson Nets that use identifiers to refer to the objects they manipulate. Typed Jackson Nets enjoy the reconstructability property which states that the composition of the processes and the interactions of a decomposed typed Jackson Net yields a model that is bisimilar to the original system. We exploit this property to demonstrate that if a process discovery algorithm ensures rediscoverability, the system of interacting processes is rediscoverable.
AB - A process discovery algorithm aims to construct a model from data generated by historical system executions such that the model describes the system well. Consequently, one desired property of a process discovery algorithm is rediscoverability, which ensures that the algorithm can construct a model that is behaviorally equivalent to the original system. A system often simultaneously executes multiple processes that interact through object manipulations. This paper presents a framework for developing process discovery algorithms for constructing models that describe interacting processes based on typed Jackson Nets that use identifiers to refer to the objects they manipulate. Typed Jackson Nets enjoy the reconstructability property which states that the composition of the processes and the interactions of a decomposed typed Jackson Net yields a model that is bisimilar to the original system. We exploit this property to demonstrate that if a process discovery algorithm ensures rediscoverability, the system of interacting processes is rediscoverable.
UR - http://www.scopus.com/inward/record.url?scp=85171440641&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-33620-1_3
DO - 10.1007/978-3-031-33620-1_3
M3 - Conference contribution
SN - 9783031336195
VL - 13929
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 37
EP - 58
BT - PETRI NETS 2023: Application and Theory of Petri Nets and Concurrency
A2 - Gomes, Luis
A2 - Lorenz, Robert
PB - Springer
Y2 - 26 June 2023
ER -