Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Reisig, “Petri Nets An Introduction”, EATCS Monograph on Computer Science, Springer Verlag, Berlin (1985).
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).
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).
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).
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).
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).
W. Reisig, Place/Transition nets, in: [4], pp.117–141 (1987).
J. Desel and J. Esparza, “Structure and Analysis of Choice Nets”, Monograph in preparation.
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).
E. Best, Structure theory of Petri nets: the Free Choice Hiatus. in: [4], pp. 168–206 (1987).
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).
G. Winskel, Petri nets, algebras, morphisms and compositionality, Information and Computation 72, pp.197–238 (1987).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Merceron, A. (1994). Morphisms to Preserve Sructural Properties of Petri Nets. In: Baeza-Yates, R. (eds) Computer Science 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-9805-0_36
Download citation
DOI: https://doi.org/10.1007/978-1-4757-9805-0_36
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-9807-4
Online ISBN: 978-1-4757-9805-0
eBook Packages: Springer Book Archive