Abstract
The synthesis problem for Petri nets consists in the construction of a net system whose behaviour is specified by a given transition system. In this paper we deal with the synthesis of elementary net systems extended with inhibitor arcs, i.e. arcs that test for absence of tokens in a place. We characterize the class of transitions systems corresponding to the sequential execution of these nets, which is a proper extension of the one obtained by the execution of nets without inhibitor arcs. Finally, we try to minimize the number of inhibitor arcs; we look for conditions guaranteeing that an inhibitor arc is really used, i.e. its presence influences the behaviour of the net.
Research partially supported by MURST, quota 60%.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Badouel, L. Bernardinello, and P. Darondeau. The synthesis problem for elementary net systems is NP-complete. Inria Research Report 2558, 1995. to appear in Theoretical Computer Science.
E. Badouel and P. Darondeau. Trace nets and process automata. Acta Informatica, 32:647–679, 1995.
E. Badouel and P. Darondeau. On the synthesis of general Petri nets. Inria Research Report 3025, 1996.
L. Bernardinello. Synthesis of net systems. In Application and Theory of Petri Nets 1993, Lecture Notes in Computer Science 691, pages 89–105, 1993.
N. Busi and R. Gorrieri. A Petri net semantics for π-calculus. In Proceeding of CONCUR'95, Lecture Notes in Computer Science 962, pages 145–159, 1995.
N. Busi and G. M. Pinna. Nonsequential semantics for contextual P/T nets. In Application and Theory of Petri Nets 1996, Lecture Notes in Computer Science 1091, pages 113–132, 1996.
J. Desel and W. Reisig. The synthesis problem of Petri nets. Acta Informatica, 33:296–315, 1996.
A. Ehrenfeucht and G. Rozenberg. Partial (set) 2-structures; I and II. Acta Informatica, 27:315–368, 1990.
U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32:545–596, 1995.
M. Mukund. Petri nets and step transition systems. International Journal of Foundations of Computer Sciences, 3:443–478, 1992.
M. Nielsen, G. Rozenberg, and P. S. Thiagarajan. Elementary transition systems. Theoretical Computer Science, 96:3–33, 1992.
P. S. Thiagarajan. Elementary net system. In Advances in Petri Nets 1986: Part I, Lecture Notes in Computer Science 254, pages 26–59, 1987.
W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. Univerität Augsburg, Institut für Mathematik, Report 352, 1996.
P. W. Hoogers, H. C.M. Kleijn, and P. S. Thiagarajan. An event structure semantics for general Petri nets. Theoretical Computer Science, 153:129–170, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busi, N., Pinna, G.M. (1997). Synthesis of nets with inhibitor arcs. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-63141-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63141-5
Online ISBN: 978-3-540-69188-4
eBook Packages: Springer Book Archive