Advertisement

Synthesis of nets with inhibitor arcs

  • Nadia Busi
  • G. Michele Pinna
Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1243)

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.

Keywords

Transition System State Graph Inhibiting Condition Synthesis Problem Label Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    E. Badouel and P. Darondeau. Trace nets and process automata. Acta Informatica, 32:647–679, 1995.Google Scholar
  3. 3.
    E. Badouel and P. Darondeau. On the synthesis of general Petri nets. Inria Research Report 3025, 1996.Google Scholar
  4. 4.
    L. Bernardinello. Synthesis of net systems. In Application and Theory of Petri Nets 1993, Lecture Notes in Computer Science 691, pages 89–105, 1993.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    J. Desel and W. Reisig. The synthesis problem of Petri nets. Acta Informatica, 33:296–315, 1996.Google Scholar
  8. 8.
    A. Ehrenfeucht and G. Rozenberg. Partial (set) 2-structures; I and II. Acta Informatica, 27:315–368, 1990.Google Scholar
  9. 9.
    U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32:545–596, 1995.Google Scholar
  10. 10.
    M. Mukund. Petri nets and step transition systems. International Journal of Foundations of Computer Sciences, 3:443–478, 1992.Google Scholar
  11. 11.
    M. Nielsen, G. Rozenberg, and P. S. Thiagarajan. Elementary transition systems. Theoretical Computer Science, 96:3–33, 1992.Google Scholar
  12. 12.
    P. S. Thiagarajan. Elementary net system. In Advances in Petri Nets 1986: Part I, Lecture Notes in Computer Science 254, pages 26–59, 1987.Google Scholar
  13. 13.
    W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. Univerität Augsburg, Institut für Mathematik, Report 352, 1996.Google Scholar
  14. 14.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Nadia Busi
    • 1
  • G. Michele Pinna
    • 1
  1. 1.Dipartimento di MatematicaUniversità di SienaSienaItaly

Personalised recommendations