Skip to main content
SpringerLink
Log in

A new technique for finding a generating family of siphons, traps and st-components. Application to colored Petri nets

  • Conference paper
  • First Online:
Advances in Petri Nets 1993 (ICATPN 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 674))

Included in the following conference series:

Abstract

In this paper we propose a new solution to the problem of finding generating families of siphons (structural dead-locks in classical terminology), traps and st-components in Petri Nets. These families are obtained as solutions of some systems of linear inequalities. Their transformation into a system of linear equations allows to interpret the technique as follows: traps (siphons, st-components) of a net N are deduced from the support of psemiflows of a transformed net NΘ(NΣ,NΣΘ).

One of the basic advantages of the proposed technique is its direct applicability to colored nets, allowing the symbolic computation of traps (siphons, st-components), whose definitions are introduced in this work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ALAIWAN H., TOUDIC J.F., Recherche des semi-flots, des verrous et des trappes dans les réseaux de Petri, TSI.vol. 4,n.1, 1985, p. 103–112.

    Google Scholar 

  2. BARKAOUI K., LEMAIRE B., An effective characterization of minimal deadlocks and traps in Petri Nets based on graph theory Proc. of the 10h. Petri Net Conference on Theory and Applications of Petri Nets, Bonn, 1989

    Google Scholar 

  3. BRAMS G.W., Réseaux de Petri. Theorie et Pratique (2 vol.), Masson, Paris, 1983

    Google Scholar 

  4. COUVREUR J.M., HADDAD S., PEYRE J.F., Computation of Generative Families of Positive Semi-flows in Two Types of Colored Nets, 12h. Petri Net Conference on Theory and Applications of Petri Nets, Gerjn (Denmark), June 1991.

    Google Scholar 

  5. COLOM J.M., SILVA M., Convex Geometry and Semiflows in P/T Nets. A comparative Study of Algorithms for Computation of Minimal p-Semiflows. 10th International Conference on Application and Theory of Petri Nets, Bonn, 1989.

    Google Scholar 

  6. ESPARZA J., Structure theory of Free Choice Nets, Ph. D. Thesis, Universidad de Zaragoza (Spain), 1989

    Google Scholar 

  7. ESPARZA J., SILVA M., A polynomial-time algorithm to decide liveness of bounded free choice nets, To appear in Theoretical Computer Science.

    Google Scholar 

  8. ESPARZA J., SILVA M., BEST E., Minimal deadlocks in Free Choice Nets, Hildesheimer Informatik Fachberichte 1/89, 1989

    Google Scholar 

  9. HADDAD S., Une catégorie régulière de réseau de Petri de haut niveau: définition, propriétés et réductions. Application à la validation de systèmes distribués, Thèse de l'Université Pierre et Marie Curie, Paris, 1987

    Google Scholar 

  10. LAUTENBACH K., Linear Algebraic calculation of deadlocks and traps, Concurrency and nets, Voss-Genrich-Rozenberg eds., Springer Verlag,1987.

    Google Scholar 

  11. MEMMI G., Methode d'analyse de réseaux de Petri, réseaux à files, et applications au temps réel, Thèse de l'Université Pierre et Marie Curie, Paris, 1983.

    Google Scholar 

  12. MEMMI G., VAUTHERIN J., Analysing nets by the invariant method, Advances in Petri Nets 1986, L.N.C.S. 254, Springer-Verlag,1987.

    Google Scholar 

  13. MINOUX M., BARKAOUI K., Polynomial time algorithms for proving or disproving Commoner's structural property in Petri Nets, Proc. of the 9th. Petri Net Conference on Theory and Applications of Petri Nets, Venice, 1988

    Google Scholar 

  14. MINOUX M., BARKAOUI K., Polynomial algorithms for finding deadlocks, traps and other substructures relevant to Petri net analysis, Internal research report N. 212 of the Laboratoire MASI, Univ. Paris 6, Paris, 1988

    Google Scholar 

  15. SIFAKIS J., Contrôle des systèmes asynchrones: concepts, proprietés, analyse statique, Thèse de l'Université Scientifique et Médical de Grenoble, 1979.

    Google Scholar 

  16. SILVA M., Las redes de Petri en la Informática y la Automática, Ed. AC, Madrid, 1985.

    Google Scholar 

  17. TOUDIC J.M., Algorithmes d'analyse structurelle de réseaux de Petri, Thèse de l'Université Pierre et Marie Curie, Paris, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. Ingeniería Eléctrica e Informática, Universidad de Zaragoza, C/ María de Luna 3, 50015, Zaragoza, Spain

    J. Ezpeleta

  2. Laboratoire MASI, Université Paris VI, 4, Place Jussieu, 75252, Paris Cedex 5, France

    J. M. Couvreur

  3. Dpto. Ingeniería Eléctrica e Informática, Universidad de Zaragoza, C/ María de Luna 3, 50015, Zaragoza, Spain

    M. Silva

Authors
  1. J. Ezpeleta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. M. Couvreur
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ezpeleta, J., Couvreur, J.M., Silva, M. (1993). A new technique for finding a generating family of siphons, traps and st-components. Application to colored Petri nets. In: Rozenberg, G. (eds) Advances in Petri Nets 1993. ICATPN 1991. Lecture Notes in Computer Science, vol 674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56689-9_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-56689-9_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56689-2

  • Online ISBN: 978-3-540-47631-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation