C.V. Ramamoorthy and Gary S. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Trans on Software Engineering, SE-6(5):440--49, September 1980.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....scientific programs and found that repetitive patterns can be reached very fast. This verifies the feasibility of employing such methods in a compiler. Section 2 defines the timed Petri nets and reviews the basic theories on timed marked graph (for an introduction to basic Petri net theory, see [26, 28, 27]) Section 3 defines a class of loops known as a static dataflow software pipeline (SDSP) This class includes loops both with and without loop carried dependences. In the third section we also describe how to obtain a corresponding Petri net loop representation, SDSP PN. In Section 4, the ....

....of concurrent systems to determine the computation rate (or equivalently the cycle time) which describes the number of firings of a transition per unit time as the modeling system is operating at its maximum rate. Listed below is a review of results regarding the cycle time of a timed marked graph [27]: Definition 2.3.1 The cycle time of transition t i is defined as lim n 1 i where X i is the time at which transition t i initiates its n th execution. ffl The number of tokens in a simple cycle remains the same after any firing sequence. ffl All transitions in a marked graph have the ....

[Article contains additional citation context not shown here]

C. V. Ramamoorthy and G. S. Ho. Performance evaluation of asynchronous concurrent systems using Petri Nets. IEEE Transactions on Computers, pages 440--448, September 1980.

....The distinguishing features of the timing mechanisms are whether the duration of the events is modelled by deterministic variables or random variables, and whether the time is associated to the PN places, transitions or tokens. Earlier work in timed PN with deterministic timing can be found in [32, 43, 40, 47]. Application of deterministic PN models are available in di#erent areas, like: communication protocols, performance evaluation, manufacturing. However, in the reliability area stochastic modelling is more appropriate, and therefore we will consider in the sequel only TPN in which the timing ....

C.V. Ramamoorthy and G.S. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Transactions on Software Engineering, SE-6:440--449, 1980.

....removes the tokens from the input places, performs its action, and puts the calculated tokens into its output places. The reserved tokens cannot be accessed by any other transition during the firing of the transition. This concept of time has already been defined for the original Petri nets by [Sif77, Zub80, CC89, Ram80]. 3 Requirements for the common model With the modelling technique described above a common model for computer based systems and physical systems can be constructed. For this purpose, three problems have to be addressed: 1. digital modelling for computer based systems, 2. analogue modelling ....

C.V. Ramamoorthy. Performance evaluation of asynchronous concurrent systems using petri nets. IEEE Transactions on Software Engineering, 6(5):440--449, September 1980.

....it can be done. The category of stochastic constructs can be subdivided into two groups: probability distribution for the ring times of the transitions This broad category encompasses many di erent choices, according to the allowed distribution types and other features: constant times [9] vs. random times [1, 3, 4, 5, 6, 7, 8] discrete times [9, 1, geometric] vs. continuous times [3, 4, 6, 8, 1, exponential] memoryless distributions (geometric for discrete time, exponential for continuous time) 1, 3, 7, 6, exponential only] vs. general distributions [4, 6, phase type] ....

C. V. Ramamoorthy and G. S. Ho, \Performance evaluation of asynchronous concurrent systems using Petri nets," IEEE Trans. Softw. Eng., vol. 6, Sept. 1980.

.... Petri Nets There are various possibilities of including time parameters in (standard) Petri nets, that can be categorized with respect to the type of nodes time is assigned to and the nature of the time value itself: time parameters can be associated with transitions [Ramc 74, Merl 76, Zube 80, Rama 80, Razo 84] or places [Sifa 77] or even both on the other hand timing itself may be deterministic [Holl 87] or probabilistic [Moll 82, Duga 84, Ajmo 84] an instance of a random variable) or again a mixture [Ajmo 87b] The class of timed Petri net models we focus in this work is where timing ....

C. V. Ramamoorthy and G. S. Ho. "Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets". IEEE Transactions on Software Engineering, Vol. SE-6, No. 5, pp. 440 --449, Sep. 1980.

....a generic problem in analyzing timed concurrent and distributed systems. In this paper, we focus on bounding average TSE s of such systems that can be modeled using stochastic timed marked graphs (e.g. 1] also referred to as timed event graphs (e.g. 2, 3] or decision free Petri nets (e.g. [4]) Although marked graphs are a restrict class of Petri nets [5] they constitute an adequate model for many real world systems, including many asynchronous circuits and embedded systems. In different application domains, the TSE s are typically characterized either for their extreme values or for ....

....extreme values or for their average values. Extreme values of TSE s can be very useful in verifying correct operations (e.g. 6, 7] On the other hand, the average TSE s are particularly important in analyzing system performance such as average throughput, latency, and resource utilization (e. g, [8, 4, 9, 10]) as well as possibly yield estimation. For instance, the average throughput of an asynchronous pipeline is the inverse of the average time separation of consecutive output requests. Over the last two decades, the problem of computing the average TSE s in basic classes of Petri nets has been ....

[Article contains additional citation context not shown here]

C. V. Ramamoorthy and G. S. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Transactions on Software Engineering, 6(5):440--449, September 1980. 18

....AOC STG. 3.3.1 STG unfolding A key problem of our verification and analysis techniques is to find the time separation between two transitions, as it will be discussed in Section 3.3.2. This problem is not trivial for live nets, even for sub classes of Petri nets using deterministic firing times [110, 117], or using interval data [3, 67] In this section we describe the execution of a signal transition graph using partial orders. Partial orders have been used to describe the operational semantics of concurrent systems [54, 12] In contrast to the interleaving semantics of reachability graphs ....

C. V. Ramamoorthy and Gary S. Ho, "Performance Evaluation of Asynchronous concurrent systems using Petri nets", IEEE Transactions on Software Engineering, vol. SE-6, No. 5, pp. 440--449, September 1980.

....mechanisms are thus to be devised, and Petri nets can also be used to model the communication protocols between the objects. Usual communication protocols such as unidirectional message sending or question answer conversations in a client server flavor are easy to model, as demonstrated by [RAM 80, SIB 93] In the Petri nets inside Objects trend, Petri nets are thus used to model both the inner behavior of objects, and the inter objects communications. There is usually a way to construct an single net describing the behavior of the whole system out of the nets of the cooperating objects. ....

Ramamoorthy C.V., HO G.S. Performance evaluation of asynchronous concurrent systems using Petri nets, IEEE Transactions on Software Engineering, vol. SE-6, N 5, September 1980, p 440-449.

....how much time has elapsed between the firings of these two transitions. This section will be used to discuss the issues that arise when time is introduced into the control framework. The most common way of introducing time into a Petri net model of a system is through the use of timed Petri nets [23, 25]. A timed net works like an ordinary Petri net but includes a new function defined on either the transitions or the places of the net. The function indicates the 34 amount of time required for particular transitions to fire or the amount of time that must elapse between the arrival of a token in ....

C. V. Ramamoorthy and G. S. Ho, "Performance evaluation of asynchronous concurrent systems using Petri nets", IEEE Transactions on Software Engineering, vol. 6, no. 5, 1980.

....marked when the ring starts, and unmarked when ring ends. 2.3 Firing Semantics ECATNets integrate two di erent kinds of timing aspects and both relate to transitions. ECATNets o er delay times as de ned for Stochastic Petri Nets [1] They also provide ring times as de ned for Timed Petri Nets [29], which are usually preferred for modelling an activity duration while delay times are more suitable to represent a waiting period or a preparation time. Two ring policies can be de ned for ECATNets, leading to di erent semantics and intents for di erent modelling domains. Firstly, a transition ....

C.V. Ramamoorthy and G.S. Ho. Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets. IEEE Transactions on Software Engineering, SE-6(5):440-449, Sep 1980.

....very expensive. Bounds become useful in these instances since they usually require much less computation effort. Inside the domain of Petri nets, many works exist related to the performance evaluation in the case of deterministically timed models, mainly for strongly connected marked graphs [Ram74, Sif78, RH80, Mag84, Mur85]. Extensions to non ordinary nets have been presented in the case of deterministic timing [Hil88] This work was partially supported by the DEMON Esprit Basic Research Action 3148 and the Plan Nacional de Investigaci on, Grant TIC 0358 89. 1 Concerning stochastic nets, only a few works exist ....

....underlying structural property to an equivalent structural property on the free choice net. This property is used in the next section to derive a polynomial method to compute the lower bound of the mean interfiring time for the original net without the generation of the marked graph. It is known [Ram74, RH80, Mur85, CCCS89] that the problem of finding a lower bound for the mean interfiring time of transitions in a strongly connected stochastic marked graph can be solved looking at the cycle times associated with each minimal P semiflow (circuits for marked graphs) of the net, considered in isolation (in fact, the ....

C. V. Ramamoorthy and G. S. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Transactions on Software Engineering, 6(5):440--449, September 1980.

.... About the reachability of the bound The above bound, that holds for any probability distribution function of service times of transitions, happens to be the same that has been obtained for strongly connected deterministically timed marked graphs by other authors (see for example [Ram74, Sif78, RH80] but here it is considered in a practical linear programming form. For deterministically timed marked graphs, the reachability of this bound has been shown [Ram74, RH80] Even more, it has been shown [CCCS89, CCCS90] that the previous bound cannot be improved, for the case of strongly connected ....

....has been obtained for strongly connected deterministically timed marked graphs by other authors (see for example [Ram74, Sif78, RH80] but here it is considered in a practical linear programming form. For deterministically timed marked graphs, the reachability of this bound has been shown [Ram74, RH80] Even more, it has been shown [CCCS89, CCCS90] that the previous bound cannot be improved, for the case of strongly connected marked graphs, only on the base of the knowledge of the coefficients of variation for the transition service times. We remark that the importance of a tightness result ....

C. V. Ramamoorthy and G. S. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Transactions on Software Engineering, 6(5):440--449, September 1980.

....entire system. The cycle time is equal to the inverse of the system throughput J (i.e. the rate at which informative events appear on the channels) and, represents the key performance metric for the system: for all informative events n # 1, the difference (t i (1) T n) t i (n) is bounded [4, 11, 23] We naturally refer to cycle time T (G) and throughput J(G) of a lis graph G, meaning the cycle time and the throughput of the system model by G. Furthermore, the cycle time coincides with the maximum cycle mean of lis graph G, defined as l(G) max #C#G l(C) max #C#G ( w(C) C C ) ....

C. V. Ramamoorthy and G. S. Ho. Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets. IEEE Transactions on Software Engineering, 6(5):440--449, September 1980.

....of an event of a certain type will happen . This is what is usually meant by performance evaluation . Apart from discrete event computer simulation which probably remains the most widespread practice, performance evaluation is also the scope of queueing theory [11] and timed Petri nets [17]. Whereas the former involves a stochastic framework and is devoted to average long term evaluation, the latter is rather deterministic and it can deal with transient behaviour. Our approach is also deterministic although there has been already some attempt to extend it to stochastic situations ....

C.V. Ramamoorthy and G.S. Ho, "Performance evaluation of asynchronous concurrent systems using Petri nets", IEEE Trans. on Software Engineering, Vol. SE--6, pp. 440--449, 1980.

....schedule that produces the optimal behaviour of the net, i.e. performing this schedule, the throughput of the net is maximum. 3.2 Previous Results In the literature of PN s there are some works dealing with the scheduling problem. Earlier works are related with bounds and cycle time of PN s; [19, 11] developed these bounds. Specially, Ramamoorthy and Ho proved that for MG s the bound is reachable, and the proof of this fact gives an algorithm to obtain the starting firing time of each transition. Later, 3, 2] proved that for MG s, the rule fire transitions as soon as they are enabled obtains ....

C. Ramamoorthy and G. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Trans. on Soft. Eng., 6(5):440-- 449, September 1980.

....a framework for determining the time needed to perform computations using asynchronous systems, and applies especially to repetitive computations. Early work in the scheduling of concurrent computing elements [14] is closely related to our approach. Previous work in the area of timed Petri nets [13, 6] applies to this problem as well. The results we describe here are based on event rule systems, a different formalism that is more closely connected to the methods we use to synthesize the asynchronous systems. Furthermore, we use our formalism to model the performance of asynchronous circuits, ....

C.V. Ramamoorthy and Gary S. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Transactions on Software Engineering, 6(5):440--449, September 1980.

....functional sublanguage in hopCP. The specifications in the HDL can be automatically translated into a flexible intermediate form that facilitates flow analysis and performance estimation by graph theoretic techniques developed in classical optimization theory (such as [11] and Petri net theory [20, 48]. The graph theoretic basis also facilitates the adoption of techniques for developed in programming language compilers and synchronous high level synthesis systems [12] The design tools are integrated on a common platform. This facilitates development of new tools and provides a means to ....

Ramamoorthy, C., and Ho, G. Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets. IEEE Transactions on Software Engineering SE-6, 5 (Sept. 1980), 440--449.

....for a unified tool for the design of such systems. In [48, 81, 189, 250] and references therein, PNs are utilized for the modeling and analysis of DEDS. As a time incorporated graphical modeling and analysis tool, PNs are invaluable for the modeling, analysis, simulation and performance evaluation [36, 51, 55, 90, 144, 156, 157, 165, 170, 187, 208] of real time systems. In [33] PNs have been utilized for scheduling and control of FMSs. A thorough review of PN synthesis techniques and applications to manufacturing systems may be found in [48, 52, 103, 159, 178, 250] There exist two basic approaches to PN modeling of systems. These are: ....

....M. The Control of Discrete Event Systems , Proceedings of the IEEE, Vol. 77, No. 1, Jan. 1989. 70 [186] Ramamoorthy, C. and Ho, G. Performance Evaluation of Asynchronous Concurrent Systems using Petri Nets , IEEE Transactions on Software Engineering, Vol. 6, No. 5, Sept 1980, pp. 440 449. [187] Ramamoorthy, C. V. and Ho, G. S. Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets , IEEE Transactions on Software Engineering, Vol. SE 6, No. 5, Sept. 1980, pp. 440 449. 188] Ramaswamy, S. and Valavanis, K. P. Extended Petri Net Based Modeling, Analysis and ....

Ramamoorthy, C. V., and Ho, G. S., "Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets", IEEE Transactions on Software Engineering, Vol. SE--6, No. 5, Sept. 1980, pp. 440--449.

....W. M. Supervisory Control of a Class of Discrete Event Processes , SIAM Journal on Control and Optimization, Vol. 25, No. 1, Jan. 1987, pp. 206 230. 185] Ramadge, P. J. and Wonham, W. M. The Control of Discrete Event Systems , Proceedings of the IEEE, Vol. 77, No. 1, Jan. 1989. 70 [186] Ramamoorthy, C. and Ho, G. Performance Evaluation of Asynchronous Concurrent Systems using Petri Nets , IEEE Transactions on Software Engineering, Vol. 6, No. 5, Sept 1980, pp. 440 449. 187] Ramamoorthy, C. V. and Ho, G. S. Performance Evaluation of Asynchronous Concurrent Systems Using ....

Ramamoorthy, C., and Ho, G., "Performance Evaluation of Asynchronous Concurrent Systems using Petri Nets", IEEE Transactions on Software Engineering, Vol. 6, No. 5, Sept 1980, pp. 440--449.

No context found.

C.V. Ramamoorthy and Gary S. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Trans on Software Engineering, SE-6(5):440--49, September 1980.

No context found.

C. V. Ramamoorthy and G. S. Ho, "Performance evaluation of asynchronous concurrent systems using petri nets," IEEE Trans. Software Eng., vol. SE-6, no. 5, pp. 440--449, 1980.

No context found.

C. V. Ramamoorthy and G. S. Ho, "Performance evaluation of asynchronous concurrent systems by Petri nets," IEEE Transactions on Software Engineering, Vol. 6, No. 5, 1980, pp. 440-449.

No context found.

C. V. Ramamoorthy and G. S. Ho, "Performance evaluation of asynchronous concurrent systems using Petri nets," IEEE Transactions on Software Engineering, Vol. SE-6, No. 5, 1980, pp. 440-449.

No context found.

C.V Ramamoorthy and G.S. Ho, #Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets," IEEE Trans. on Soft. Eng., Vol. 6, Sep. 1980.

No context found.

C.V. Ramamoorthy and G.S. Ho, Performance evaluation of asynchronous concurrent systems using Petri nets, IEEE Trans. Software Engineering, SE 6(5):440-449, 1980

First 50 documents  Next 50

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