Automatic Decomposition of Petri Nets into Automata Networks - A Synthetic Account - Archive ouverte HAL Access content directly
Conference Papers Year :

Automatic Decomposition of Petri Nets into Automata Networks - A Synthetic Account

(1) , (1) , (2)
1
2

Abstract

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 reformu-late 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.
Fichier principal
Vignette du fichier
Bouvier-Garavel-PonceDeLeon-20.pdf (385.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02875957 , version 1 (19-06-2020)

Identifiers

  • HAL Id : hal-02875957 , version 1

Cite

Pierre Bouvier, Hubert Garavel, Hernan Ponce de León. Automatic Decomposition of Petri Nets into Automata Networks - A Synthetic Account. PETRI NETS 2020 - 41st International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2020, Paris, France. ⟨hal-02875957⟩
166 View
115 Download

Share

Gmail Facebook Twitter LinkedIn More