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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho A.V., Hopcroft J.E., Ullman J.D.: The design and analysis of computer algorithms, (third printing), Addison-Wesley Publishing Company (76)
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”
Badouel E., Bernardinello L. and Darondeau P.: Polynomial algorithms for the synthesis of bounded nets, Proceedings Caap'95 LNCS 915 (95) p. 364–378
Badouel E., Bernardinello L. and Darondeau P.: The synthesis problem for elementary net systems is NP-complete. INRIA Research Report 2558 (95).
Bernardinello L.: Synthesis of net systems, application and theory of Petri nets, Springer Verlag Lecture notes in computer science, vol 691 (93) p. 89–105
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)
Gondran M. and Minoux M.: Graphes et algorithmes. Eyrolles, Paris (85)
Desel J. and Reisig W.: The synthesis problem of Petri nets. TUM research report, Munich (92).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmitt, V. (1996). Flip-flop nets. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_42
Download citation
DOI: https://doi.org/10.1007/3-540-60922-9_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60922-3
Online ISBN: 978-3-540-49723-3
eBook Packages: Springer Book Archive