| Julia Padberg, Maike Gajewsky, and Kathrin Homann. Incremental Development of Safety Properties in Petri Net Transformations. In G. Engels and G. Rozenberg, editors, Theory and Application of Graph Transformations (TAGT'98), Lecture Notes in Computer Science 1764, pages 410-425. Springer Verlag, 1999. |
....and actual parameters. We explain the used categorical concepts in a way that is easy to understand. Moreover we list our results and give an intuitive explanation. These notions and results are then illustrated in Section 4 with a few examples from our case studies ( rst presented in [Erm96,PGH99] We show how the notions given for parameterized net classes are applied in concrete net classes, that are obtained by actualization of the formal net structure and data type formalism parameter. The second part presents Part II: Theory of Parameterized Net Classes Based on Abstract Petri Nets. ....
....for this purpose. One simple generalization is to replace f generated by fP : P 1 P 2 by an arbitrary monoid homomorphism fP : P 1 P 2 . This allows to map one place p 1 in P 1 to a sum of places, that is p 1 7 n p p for p 2 i 2 P 2 , which is important for re nement. In [PGH99] we introduce various morphisms that preserve safety properties in the sense of [MP92] These are illustrated in the examples in Section 4. 6. A morphism f : N 1 ## N 2 of place transition nets preserves the ring behavior: If transition vector v 2 F (T ) is enabled under marking m in net N 1 ....
[Article contains additional citation context not shown here]
Julia Padberg, Maike Gajewsky, and Kathrin Homann. Incremental Development of Safety Properties in Petri Net Transformations. In G. Engels and G. Rozenberg, editors, Theory and Application of Graph Transformations (TAGT'98), Lecture Notes in Computer Science 1764, pages 410-425. Springer Verlag, 1999.
....in [34] We have meanwhile continued our e orts in this line of research. First we have investigated further morphisms, that preserve safety properties, so called transition gluing morphisms. These have been rst developed for place transition net systems in [33] In the selected contribution in [35] we have extended rules in a way that safety properties may as well be introduced to the model (the detailed proofs can be found in [17] This approach has then be transferred to algebraic high level nets in [36] where due to space limitations the proofs are also given in a technical report ....
....new technique of rule based re nement can be adapted easily to other high level Petri net formalisms, because in [29,12] a uniform approach to Petri nets is developed where the abstract frame for rule based re nement is already formulated. The present paper is the rst within a line of papers [33,35,36], 32] concerned with safety properties of Petri nets under net transformations. Similar results could be achieved also for place transition nets and coloured Petri nets. In the later papers we have also enriched this theory by explicitly introducing new safety proporties hand in hand with the ....
J. Padberg, M. Gajewsky and K. Homann, Incremental Development of Safety Properties in Petri Net Transformations, in: G. Engels and G. Rozenberg, eds., Theory and Application of Graph Transformations (TAGT'98), Lecture Notes in Computer Science, Vol. 1764 (Springer, Berlin, 1999) 410-425.
....Therefore, a rule may be applied more than once to a given model performing the same modi cation to di erent subnets. The rule based approach has been successfully applied in [Erm96, EPE96] for the development of a large case study of a medical information system and for numerous smaller examples [PGE98, PGH99, PHG00]. Enhancement by an aspect depends on the underlying paradigm of the Petri net based process model. When only one rich Petri net class is employed throughout the development process, the addition of an aspect is performed by assigning a description which had until then not been speci ed. This ....
....This follows from the fact that elementary nets are an instance of abstract Petri nets [Pad96] which are a high level replacement system. p 3. 3 Category marked PT of Marked Place Transition Nets We here give a brief review of marked place transition nets which have been extensively studied in [GHP99, PGH99]. De nition 3.9 (Marked Place Transition Net) A marked place transition net is given by N = P; T ; pre; post; b m) with P the set of places, T the set of transitions, pre; post : T P the pre and postdomain of transitions, and b m 2 P describes the initial marking. 2 The de nition of ....
[Article contains additional citation context not shown here]
Julia Padberg, Maike Gajewsky, and Kathrin Homann. Incremental Development of Safety Properties in Petri Net Transformations. In G. Engels and G. Rozenberg, editors, Theory and Application of Graph Transformations(TAGT'98), Lecture Notes in Computer Science 1764, pages 410-425. Springer Verlag, 1999.
....which cannot be developed monolithicly, like e.g. in [Erm96,EPE96] re ning rules which allow the propagation of system properties from the transformed to the resulting net. Explicit notion of re ning rules have been already introduced for safety preservation for place transition systems [PG98,GHP99,PGH99], algebraic high level nets [PGE98,PHG00,PGE01] and coloured Petri nets [PG00b,PG00a] In this paper we have expanded the range to liveness preserving rules for place transition systems. compatibility of net class transformations, see [Gaj00] with plain rules. This allows propagating ....
Julia Padberg, Maike Gajewsky, and Kathrin Homann. Incremental Development of Safety Properties in Petri Net Transformations. In G. Engels and G. Rozenberg, editors, Theory and Application of Graph Transformations (TAGT'98), Lecture Notes in Computer Science 1764, pages 410-425. Springer Verlag, 1999.
.... This technique called rule based refinement is based on rules and transformations of Coloured Petri Nets preserving safety properties in the sense of [MP92] First steps towards this approach have been suggested for algebraic high level nets [PGE98] and place transition nets [PGH99] already. The results presented here exceed the previous in the way safety properties can be preserved or even introduced. The proposed rule based refinement is applied to the development of a traffic control system for illustration. The presented results have been achieved on a more abstract ....
....at FASE98 [PGE98] First of all this contribution exceeds the above paper as several extensions are provided. We introduce different kinds of safety preserving morphisms and rules that themselves introduce safety properties. For place transition nets we have already formulated some of the ideas in [PGH99]. The technical background of this paper is based on abstract Petri nets. This framework, namely typed high level abstract Petri nets [Pad96,Pad99a] provides parameterized net classes, with parameters for the data type and the net structure. By instantiation we achieve among others also Coloured ....
J. Padberg, M. Gajewsky, and K. Hoffmann. Incremental Development of Safety Properties in Petri Net Transformations. In G. Engels and G. Rozenberg, eds., Theory and Application of Graph Transformations (TAGT98). Springer Verlag, 1999. to appear in Lecture Notes in Computer Science.
....here sketch rst approaches to meet the above requirements. In the case of model transformation preservation of system properties (Requirement 1) leads to rule based re nement introduced in [Pad96, Pad99] Rule based re nement has already been employed for the preservation of safety properties in [PGE98, PG98, PGH99, PHG00]. Net class transformation has to be treated seperately. There are already some results in literature concerning preservation of properties by functors, e.g. Lil95] which do not yet cover all system properties. Furthermore, a combined transformation preserves a property if all involved net ....
Julia Padberg, Maike Gajewsky, and Kathrin Homann. Incremental Development of Safety Properties in Petri Net Transformations. In G. Engels and G. Rozenberg, editors, Theory and Application of Graph Transformations (TAGT'98). Springer Verlag, 1999. to appear in Lecture Notes in Computer Science. 11
No context found.
Julia Padberg, Maike Gajewsky, and Kathrin Homann. Incremental Development of Safety Properties in Petri Net Transformations. In G. Engels and G. Rozenberg, editors, Theory and Application of Graph Transformations (TAGT'98), Lecture Notes in Computer Science 1764, pages 410-425. Springer Verlag, 1999.
No context found.
Julia Padberg, Maike Gajewsky, and Kathrin Homann. Incremental development of safety properties in Petri net transformations. In Ehrig et al. [EEKR00].
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