Flip-Flop Nets - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 1995

Flip-Flop Nets


The so-called synthesis problem for nets which consists in deciding whether a given automaton is isomorphic to the case graph of a net and then constructing the net has been solved for various type of nets ranging from elementary nets to Petri nets. Though P/T nets admits polynomial time synthesis algorithms, the synthesis problem for elementary nets is known to be NP-complete. Applying the principle of generalized regions inherited from the P/T nets representation to the boolean setting gives rise to flip-flop nets. These nets are a slight generalization of elementary nets and admits a polynomial time synthesis.
Fichier principal
Vignette du fichier
RR-2587.pdf (221.91 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00074096 , version 1


Vincent Schmitt. Flip-Flop Nets. [Research Report] RR-2587, INRIA. 1995. ⟨inria-00074096⟩
58 View
107 Download


Gmail Facebook Twitter LinkedIn More