HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Polynomial Algorithms for the Synthesis of Bounded Nets

Eric Badouel 1 Luca Bernardinello 1 Philippe Darondeau 1
1 MICAS - Modèles et implémentation des calculs syntaxiques
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : The so-called synthesis problem for nets, which consists in deciding whether a given graph is isomorphic to the case graph of some net, and then constructing the net, has been solved in the litterature for various types of nets, ranging from elementary nets to Petri nets. The common principle for the synthesis is the idea of regions in graphs, representing possible extensions of places in nets. However, no practical algorithm has been defined so far for the synthesis. We give here explicit algorithms solving in polynomial time the synthesis problem for bounded nets from regular languages or from finite automata.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 3:08:42 PM
Last modification on : Friday, February 4, 2022 - 3:25:31 AM
Long-term archiving on: : Monday, April 5, 2010 - 12:08:51 AM


  • HAL Id : inria-00074358, version 1


Eric Badouel, Luca Bernardinello, Philippe Darondeau. Polynomial Algorithms for the Synthesis of Bounded Nets. [Research Report] RR-2316, INRIA. 1994. ⟨inria-00074358⟩



Record views


Files downloads