Polynomial Algorithms for the Synthesis of Bounded Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

Polynomial Algorithms for the Synthesis of Bounded Nets

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2316.pdf (391.71 Ko) Télécharger le fichier

Dates and versions

inria-00074358 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074358 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More