Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions
Robin Bergenthum, Jakub Kov\'a\v{r}

TL;DR
This paper introduces a new region theory for Petri net synthesis that unifies state-based and language-based approaches, enabling more expressive process models from behavioral specifications.
Contribution
The authors propose a novel region theory that combines state-based and language-based synthesis, overcoming their individual limitations.
Findings
The new theory can express conflicts, concurrency, and merging of local states.
It synthesizes Petri nets that simulate all input labelled nets.
The approach improves the expressiveness of process models.
Abstract
Synthesis automatically generates a process model from a behavioural specification. When the target model is a Petri net, we address synthesis through region theory. Researchers have studied region-based synthesis extensively for state-based specifications, such as transition systems and step-transition systems, as well as for language-based specifications. Accordingly, in literature, region theory is divided into two main branches: state-based regions and language-based regions. Using state-based regions, the behavioural specification is a set of global states and related state-transitions. This representation can express conflicts and the merging of global states naturally. However, it suffers from state explosion and can not express concurrency explicitly. Using language-based regions, the behavioural specification is a set of example runs defined by partially or totally ordered sets…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPetri Nets in System Modeling · Formal Methods in Verification · Business Process Modeling and Analysis
