J. Desel and A. Merceron. Vicinity Respecting Net Morphisms. In Advances in Petri Nets, pages 165-185. Springer Verlag, 1990. Lecture Notes in Computer Science 483.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....; t n denotes firing steps using transitions t 1 ; t n . B. Abstracting and Collapsing Morphisms First we introduce abstracting morphisms. These allow abstracting transitions and places onto a single transition. In this sense they are related to vicinity respecting morphisms given in [DM90], but generalized to marked place transition nets here. These abstracting morphisms are the basis for collapsing morphisms. The collapsing morphisms abstract live subnets to a single transition and hence respects liveness of the target net. Definition 1 (Abstracting Morphism) Given two ....

J. Desel and A. Merceron. Vicinity respecting net morphisms. In Advances in Petri Nets, LNCS 483, pages 165-- 185. Springer Verlag, 1990.

....nets. Moreover, we use a formal notion of rules for which e.g. compatibility concerning structuring are already available [EHKP91,EGP99] In our approach, the notion of morphism is essential. We employ morphisms which are more or less special cases of vicinity respecting morphisms, see [DM90]. They allow the abstraction of a (transition bordered) subnet to a single transition, but not dually for places like in [DM90] We lifted these from ordinary nets to marked place transition nets and t them to our purposes. In order to integrate these morphisms with rule based modi cation we ....

....[EHKP91,EGP99] In our approach, the notion of morphism is essential. We employ morphisms which are more or less special cases of vicinity respecting morphisms, see [DM90] They allow the abstraction of a (transition bordered) subnet to a single transition, but not dually for places like in [DM90]. We lifted these from ordinary nets to marked place transition nets and t them to our purposes. In order to integrate these morphisms with rule based modi cation we extend rules by such collapsing morphisms. Rule based modi cation is expressed is terms of spans of morphisms and two pushout ....

[Article contains additional citation context not shown here]

J. Desel and A. Merceron. Vicinity Respecting Net Morphisms. In Advances in Petri Nets, pages 165-185. Springer Verlag, 1990. Lecture Notes in Computer Science 483.

....nets. The practical relevance of Coloured Petri Nets is considered to be very high, not at least due to the successful tool Design CPN [JCHH91] In the area of low level Petri nets there are many contributions concerning verification with temporal logic [DDGJ90,BS90,HRH91] and refinement [BGV90] [DM90,GG90,BDH92]. In the area of high level nets, verification [Jen94,Sch96] is much more difficult and even more the compatibility of system properties This work is partly founded by the joint research project DFG Forschergruppe Petrinetz Technologie between H. Weber (Coordinator) H. Ehrig (both from the ....

J. Desel and A. Merceron. Vicinity Respecting Net Morphisms. In Advances in Petri Nets, pages 165--185. Springer Verlag, 1990. Lecture Notes in Computer Science 483.

....of refinement for Petri nets. Mostly refinement notions in Petri net literature concern the refinement of single net elements like transitions or places, for a survey see [BGV90] Additionally, refinement of behavior as considered here is often given informally, or in terms of morphisms [Des91,DM90,BG92] that preserve or reflect the behaviour of a net. Q rules provide the formal frame for integration of such morphisms with rules and thus all their advantages like locality and genericity. The main idea is to enlarge the given HLR category in order to include morphisms, that are adequate for the ....

J. Desel and A. Merceron, Vicinity Respecting Net Morphisms, Advances in Petri Nets, LNCS 483, Springer Verlag, 1990, pp. 165--185.

....these transformations do not focus on particular transitions or places, instead 3 For an overview of behaviour preserving net refinements, the reader is referred to [6] they imply transforming the entire net. Examples are: abstractions [9] and vicinity respecting net morphisms [8]. These are both behaviour oriented net morphisms, meaning that the respective morphisms aim to preserve structural properties. Actually, any net transformation can be considered a conjunction of a transformation of the net Gestalt (i.e. the underlying graph) and an appropriate transformation ....

J. Desel. Vicinity Respecting Net Morphisms. In Advances in Petri Nets '90, pages 165--185, 1990.

....Notes in Computer Science, 483:491 , 1990. CODEN LNCSD9. ISSN 0302 9743. REFERENCES 2 P [4, 5] P semiflows [4] P T [4, 5] Petri [1, 2, 3, 8, 11, 12, 13, 17] Petri net based [17] preorder [15] preserving [1] protocol [11] reduced [18] refinements [1] Regular [8] respecting [7]. ring [11] semiflows [4] sets [18] simulation [14] simulator [2] space [18] state [15, 18] stochastic [8] Stubborn [18] study [4] survey [1] synthesis [10] system [13, 14, 17] systems [10, 15] T [4, 5] transformation [15] Trellis [17] uncertain [3] unidirectional [11] via ....

.... semiflows [4] sets [18] simulation [14] simulator [2] space [18] state [15, 18] stochastic [8] Stubborn [18] study [4] survey [1] synthesis [10] system [13, 14, 17] systems [10, 15] T [4, 5] transformation [15] Trellis [17] uncertain [3] unidirectional [11] via [16] Vicinity [7]. writing [17] ....

J. Desel and A. Merceron. Vicinity respecting net morphisms. Lecture Notes in Computer Science, 483:165--??, 1990. CODEN LNCSD9. ISSN 0302-9743. Dutheillet:1990:RSP

....ToKen) are to represent the abstractions of object states, method behaviors, and token types, respectively. The property of abstraction and its refinement can be defined with the morphism between nets. The morphism shows that the constraints of an abstraction are preserved in its refined nets(RN) [Desel90, Lakos97]. In HOONet models, the a sine qua non conditions of the morphism are sufficient to show that the observable behaviors are equivalent between the abstract component and its refined net. They can also show that the token types in abstraction is fully contained into the DD of RN. The Figure 7 shows ....

J. Desel and A. Merceron, "Vicinity Respecting Net Morphism," APN'90, and also LNCS 483, 1991

.... emphasising on the refinement of isolated net elements (places transitions) and global transformations general behaviour oriented net morphisms, Research Assistant of the Belgian Fund for Scientific Research such as abstraction morphisms ( 4] and vicinity respecting net morphisms ([3]) Modularisation can be viewed as a horizontal development technique . Several system entities are identified and separately modeled. These modules are then interrelated as to constitute one overall system model. This can be realised by net composition mechanisms ( 1] Combining abstraction and ....

J. Desel. Vicinity Respecting Net Morphisms. In Advances in Petri Nets '90, pages 165--185, 1990.

No context found.

J. Desel and A. Merceron. Vicinity Respecting Net Morphisms. In Advances in Petri Nets, pages 165-185. Springer Verlag, 1990. Lecture Notes in Computer Science 483.

No context found.

J. Desel and A. Merceron. Vicinity Respecting Net Morphisms. In Advances in Petri Nets, Springer LNCS 483, pages 165-185. Springer Verlag, 1990.

No context found.

J. Desel and A. Merceron. Vicinity Respecting Net Morphisms. In Advances in Petri Nets, pages 165-185. Springer Verlag, 1990. Lecture Notes in Computer Science 483. 28

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC