A finite word is called Petri net solvable if it is isomorphic to the reachability graph of some unlabelled Petri net. In this paper, the class of two-letter Petri net solvable wo...
Communication structured occurrence nets (csons) are the basic variant of structured occurrence nets which have been introduced to characterise the behaviours of complex evolving s...
We describe a framework for the de-materialization of local public administration processes that provides remote assistance by human operators when needed. Our framework is in an a...
Giancarlo Ballauco, Paolo Ceravolo, Ernesto Damian...
Process mining techniques aim to analyze and improve conformance and performance of processes using event data. Process discovery is the most prominent process-mining task: A proce...
Wil M. P. van der Aalst, Anna Kalenkova, Vladimir ...
Abstract. This paper describes the technical challenges around the modernization process of the GreatSPN framework[15], one of the first Petri net frameworks started in the eighti...