This article revisits the problem of decomposing a Petri net into a network of automata, a problem that has been around since the early 70s. We reformulate this problem as the transformation of an ordinary, one-safe Petri net into a flat, unit-safe NUPN (Nested-Unit Petri Net) and define a quality criterion based on the number of bits required for the structural encoding of markings. We propose various transformation methods, all of which we implemented in a tool chain that combines NUPN tools with third-party software, such as SAT solvers, SMT solvers, and tools for graph colouring and finding maximal cliques. We perform an extensive evaluation of these methods on a collection of more than 12,000 nets from diverse sources, including nets whose marking graph is too large for being explored exhaustively.
CITATION STYLE
Bouvier, P., Garavel, H., & Ponce-de-León, H. (2020). Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12152 LNCS, pp. 3–23). Springer. https://doi.org/10.1007/978-3-030-51831-8_1
Mendeley helps you to discover research relevant for your work.