Morphisms to Preserve Sructural Properties of Petri Nets

  • Agathe Merceron


Petri net theory allows modeling and analysis of concurrent systems ([1], [2], [3] or [4] offer a broad introduction). To be able to draw mappings between nets is quite useful, in particular in the case of a top-down/bottom-up methodology. The classical definition of net morphism, see [5], [2], is the least restrictive definition which respects the topology of the source net. However it is too weak to respect other structural features that the source net may exhibit. Vicinity respecting morphisms restrict the classical morphism definition. They were defined in [6] where some of their properties are studied. The present paper is a continuity of [6] and shows that vicinity respecting morphisms preserve almost all relevant, structural properties of the source net.


Free Choice Surjective Morphism Strong Connectedness Restrictive Definition Output Place 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    W. Reisig, “Petri Nets An Introduction”, EATCS Monograph on Computer Science, Springer Verlag, Berlin (1985).Google Scholar
  2. [2]
    H.J. Genrich, K. Lautenbach and P.S. Thiagarajan, Elements of general net theory, in: “Net Theory and Applications”, W. Brauer, ed., Lecture Notes in Computer Science, Vol. 84, pp.21–163, Springer Verlag, Berlin (1980).CrossRefGoogle Scholar
  3. [3]
    G. Rozenberg and P.S. Thiagarajan, Petri nets: basic notions, structure, behaviour, in: “Current Trends in Concurrency Overviews and Tutorials”, Lecture Notes in Computer Science, J. W. de Baekker, W-P. Roever and G. Rozenberg, ed., Vol. 224, pp. 585–668, Springer Verlag, Berlin (1986).CrossRefGoogle Scholar
  4. [4]
    W. Brauer, W. Reisig and G. Rozenberg G., ed., “Petri Nets. Central Models and their Properties. Advances in Petri Nets 1986”, Part I, Proceedings of an Advanced Course, Bad Honnef, September 1986, Lecture Notes in Computer Science, Vol. 254, Springer Verlag, Berlin (1987).MATHGoogle Scholar
  5. [5]
    C.A. Petri, Concepts of net theory, Mathematical Foundations of Computer Science, Proceedings of Symposium and Summer School, High Tatras, Sep. 3–8, 1973, Mathematical Institute of the Slovak Academy of Sciences, pp. 137-146 (1973).Google Scholar
  6. [6]
    J. Desel and A. Merceron, Vicinity respecting morphisms. in: “Advances in Petri Nets 1990”, G. Rozenberg, ed., Lecture Notes in Computer Science Vol. 483, pp. 165–185, Springer Verlag, Berlin (1991).CrossRefGoogle Scholar
  7. [7]
    W. Reisig, Place/Transition nets, in: [4], pp.117–141 (1987).MathSciNetGoogle Scholar
  8. [8]
    J. Desel and J. Esparza, “Structure and Analysis of Choice Nets”, Monograph in preparation.Google Scholar
  9. [9]
    E. Best and C. Fernández C., Notation and terminology on Petri nets theory, Arbeitspapier der GMD Nr. 195, Gesellschaft für Mathematik und Datenverarbeitung, St. Augustin, FRG, (1987).Google Scholar
  10. [10]
    E. Best, Structure theory of Petri nets: the Free Choice Hiatus. in: [4], pp. 168–206 (1987).MathSciNetGoogle Scholar
  11. [11]
    W. Brauer, R. Gold and W. Vogler, A survey of behaviour and equivalence preserving refinements of Petri nets, in: “Advances in Petri Nets 1990”, Rozenberg G., ed., Lecture Notes in Computer Science Vol. 483, pp. 1–46, Springer Verlag, Berlin (1991).CrossRefGoogle Scholar
  12. [12]
    G. Winskel, Petri nets, algebras, morphisms and compositionality, Information and Computation 72, pp.197–238 (1987).MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1994

Authors and Affiliations

  • Agathe Merceron
    • 1
  1. 1.Depart. Ciencias de la ComputaciónUniversidad de ChileSantiagoChile

Personalised recommendations