Advertisement

Flip-flop nets

  • Vincent Schmitt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1046)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AHU76]
    Aho A.V., Hopcroft J.E., Ullman J.D.: The design and analysis of computer algorithms, (third printing), Addison-Wesley Publishing Company (76)Google Scholar
  2. [BD95]
    Badouel E. and Darondeau P.: Dualities between Nets and Automata induced by schizophrenic objects. INRIA Research Report 2452 (95). To appear in Proceedings of the “6th category theory and computer science”Google Scholar
  3. [BBD95a]
    Badouel E., Bernardinello L. and Darondeau P.: Polynomial algorithms for the synthesis of bounded nets, Proceedings Caap'95 LNCS 915 (95) p. 364–378Google Scholar
  4. [BBD95b]
    Badouel E., Bernardinello L. and Darondeau P.: The synthesis problem for elementary net systems is NP-complete. INRIA Research Report 2558 (95).Google Scholar
  5. [Ber93]
    Bernardinello L.: Synthesis of net systems, application and theory of Petri nets, Springer Verlag Lecture notes in computer science, vol 691 (93) p. 89–105Google Scholar
  6. [ER90]
    Ehrenfeucht A. and Rozenberg G.: Partial 2-structures, part 1: Basic notion and the representation problem, part 2: State spaces of concurrent systems, Acta Informatica, vol 27 (90)Google Scholar
  7. [GM85]
    Gondran M. and Minoux M.: Graphes et algorithmes. Eyrolles, Paris (85)Google Scholar
  8. [DR92]
    Desel J. and Reisig W.: The synthesis problem of Petri nets. TUM research report, Munich (92).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Vincent Schmitt
    • 1
  1. 1.IrisaRennes CedexFrance

Personalised recommendations