Morphisms to Preserve Sructural Properties of Petri Nets
Petri net theory allows modeling and analysis of concurrent systems (, ,  or  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 , , 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  where some of their properties are studied. The present paper is a continuity of  and shows that vicinity respecting morphisms preserve almost all relevant, structural properties of the source net.
KeywordsFree Choice Surjective Morphism Strong Connectedness Restrictive Definition Output Place
Unable to display preview. Download preview PDF.
- W. Reisig, “Petri Nets An Introduction”, EATCS Monograph on Computer Science, Springer Verlag, Berlin (1985).Google Scholar
- 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
- 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
- J. Desel and J. Esparza, “Structure and Analysis of Choice Nets”, Monograph in preparation.Google Scholar
- 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