G. de Jong and B. Lin. A communicating Petri net model for the design of concurrent asynchronous modules. In Proceedings of the Design Automation Conference, pages 49--55, April 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....not be disjoint) The composition of the processes is another process that models their concurrent behavior synchronizing on pairs of events with the same label. We refer the reader to [37, 57, 51] for a more formal definition of composition. The methods known so far to compose PNs are structural [51, 57, 19], i.e. they derive a new PN by combining nodes of the original PNs. These methods may however introduce redundancy in the resulting PN because they are conservative when calculating the pairs of synchronizing transitions. Moreover, they do not allow one to obtain, e.g. a Free Choice composed PN, ....

G. de Jong and B. Lin. A communicating Petri net model for the design of concurrent asynchronous modules. In Proceedings of the Design Automation Conference, pages 49--55, April 1994.

....dummy (silent) transitions in the construction of the synchronization areas . Moreover, in most practical cases many of the places and silent events added by the algorithm can be removed by local transformations during the composition process itself. In contrast, other previous approaches ( RY88, dJL94] require quadratic transition splitting and a subsequent merging of the pairs of transitions generated for every common symbol. Another approach for Petri net composition (product of two Petri nets) is presented in [Win87] This is a very liberal form of parallel composition of Petri nets in ....

....Appendix A. 4.4 4.2.2 Comparison Figure 7 depicts an example of parallel composition of Petri nets, where we can appreciate the differences between other previous methods and ours. Two simple Petri nets are taken (Figures 7 (a) and 7 (b) The result obtained by other previous approaches [RY88, dJL94] is shown in Figure 7 (c) Figure 7 (d) shows the result obtained with our composition method without optimizations, while Figure 7 (e) depicts the resulting Petri net after removing the silent events. As we can see in the example, there is more than one transition labeled with the same symbol ....

[Article contains additional citation context not shown here]

G. de Jong and B. Lin. A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules. In Proc. ACM/IEEE Design Automation Conference, pages 49-- 55, June 1994.

....use of dummy (silent) transitions in the construction of the synchronization areas. Moreover, in most practical cases many of the places and silent events added by the algorithm can be removed by local transformations during the composition process itself. In contrast, other previous approaches ([17, 6]) require quadratic transition splitting and a subsequent merging of the pairs of transitions generated for every common symbol. Another approach for Petri net composition (product of two Petri nets) is presented in [23] This is a very liberal form of parallel composition of Petri nets in which ....

G. de Jong and B. Lin. A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules. In Proc. ACM/IEEE Design Automation Conference,pages 49-- 55, June 1994.

....a full description of a system composed of several synchronizing subsystems, each one modeled by a Petri net. For simplicity, in this section we informally present the basics of Petri net composition. We refer the reader to other authors for a more detailed and formal definition of composition[48, 42, 15]. The semantics of Petri net composition is defined as follows. Let us assume that we have two different Petri nets, each one modeling a process. For each Petri net, there is an alphabet labeling the transitions (the alphabets of both Petri nets may not be disjoint) The composition of both Petri ....

....of both Petri nets may not be disjoint) The composition of both Petri nets is another Petri net that models the concurrent behavior of the processes that synchronize on pairs of transitions (one for each Petri net) with the same label. The methods known so far for composition are structural [42, 48, 15], i.e. they derive a new Petri net by combining nodes of the original Petri nets. Let us assume that the alphabets of two Petri Delay (Environment) B U U1 A Q Q1 Y Y1 (a) U1U1 U UA AB B (c) YY1 Y Y1A AQ B B Q1 U1U1 U U QQ1 (b) Figure 15: a) Speed independent circuit ....

G. de Jong and B. Lin. A communicating Petri net model for the design of concurrent asynchronous modules. In Proceedings of the Design Automation Conference, pages 49--55, April 1994.

....primitive) protocol (ae) simply results in an interchange of the input and output wire sets. This is because the output of the external (internal primitive) protocol is in fact the input of the protocol conversion specification, and vice versa, as shown in Figure 9(a) Parallel composition [7] implicitly computes the protocol conversion behavior. Both of these operators are defined in Appendix A. This is nearly correct. However, there is a problem in the interpretation of . Following this protocol graph, the protocol conversion behavior has to raise the strobe line STRB as soon as ....

....of common actions. This composition works on general nets with possibly multiple occurrences of the same action. The operator works without explicit unfolding, but produces the necessary replication of actions and places implicitly for correct construction. Definition A. 1 (Parallel Composition) [7] Let for i 2 f1; 2g, G i = hA i ; P i ; i ; m 0 i i be two Petri nets with P 1 P 2 = The parallel composition of two nets is defined as: G 1 kG 2 = hA 1 [ A 2 ; P 1 [ P 2 ; m 0 1 [ m 0 2 i where = f(PI; a; PO) 2 1 [ 2 j a 62 A 1 A 2 g [ f(PI 1 [ PI 2 ; a; PO 1 [ PO 2 ) j a 2 A ....

[Article contains additional citation context not shown here]

G. de Jong and B. Lin. A communicating Petri net model for the design of concurrentasynchronousmodules. In ACM/IEEE Design AutomationConference, June 1994.

No context found.

G. de Jong, B. Lin, "A communicating Petri net model for the design of concurrent asynchronous modules", Proc. 31st ACM Design Autom. Conf., pp. 49--55, San Diego,June 1994.

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