T.Agerwala, "Putting Petri Nets to Work," IEEE Computer , Vol.12, No.12, pp.85-94, Dec.1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....synchronization, sequentiality, concurrency and conflict. The theory of PN originated from the doctoral thesis of C.A. Petri in 1962 [39] Since then, the formal language of PN has been developed and used in many theoretical as well as applicative areas. Introductory survey papers can be found in [37, 3]. Several textbooks on the subject are also available: 38] where an extended annotated bibliography is contained) 42, 13, 44] An yearly Workshop on Application and Theory of Petri Nets is held in Europe (the IX edition of the workshop took place in Venice in June 1988) The classical PNs do ....

.... The graphical structure of a PN is a bipartite directed graph: the nodes belong to two di#erent classes (places and transitions) and the edges (arcs) are allowed to connect only nodes of di#erent classes (multiple arcs are possible in the definition of the I and O relations [38] Figure 1 is a PN [3]. The dynamics of a PN is obtained by moving the tokens in the places by means of the following execution rules: t 2 t 4 t 3 P = p t 1 t 2 t 3 t 4 t 5 T = 1 1 2 2 3 3 4 4 I(t ) p 4 5 1 5 2 4 5 3 4 2 O(t ) p M = 1, 0, 0, 0, 0) Figure 1: A PN ....

T. Agerwala. Putting Petri nets to work. IEEE Computer, pages 85--94, December 1979.

....during refinement. The ability to look forward during refinement separates the refinement strategies from the refinement tactics described in Chapter 4. Petri Nets The formal model of the knowledge in Draco is based on a Petri net [Peterson77, Peterson78] Following the definition of Agerwala [Agerwala79], a Petri net is a bipartite, directed graph N= T,P,A) where T= t1,t2, tn a set of transitions P= p1,p2, pm a set of places The union of T and P represent the nodes of the graph N which are connected by a set of directed arcs A. A marked Petri net C= T,P,A,M) further specifies a mapping ....

Agerwala, T., Putting Petri Nets to Work, IEEE Computer, 12(12):85-94, December, 1979.

....sparsity of nets as well as corresponding systems of equilibrium equations, list structure representations are proposed, and a general procedure for generation of the state space is outlined to show the required processing of list structures. 1. INTRODUCTION The major application of Petri nets [1,3,17] is modeling of systems of events in which it is possible for some events to occur concurrently but there are constraints on the precedence, concurrence or frequency of these occurrences [3,13,18] Multiprocessor and distributed systems, communication networks and data flow architectures are just ....

.... function which assigns the remaining firing time to each independent firing (if any) of a transition, i.e. if the firing rank of a transition t is equal to k, n(t) k, the remaining firing time function r(t) is a vector of k nonnegative nondecreasing real numbers denoted by r(t)[1], r(t) 2] r(t) k] r is a partial function and it is undefined for all those transitions t for which n(t) 0. An initial state s i of a net T is a triple s i = m i ; n i ; r i ) where n i is a selection function from the set Sel(m 0 ) n i 2 Sel(m 0 ) the remaining firing time function ....

[Article contains additional citation context not shown here]

T. Agerwala, "Putting Petri nets to work"; IEEE Computer, vol.12, no.12, pp.85--94, 1979.

....) ASICs Systems that contain both application specific and predesigned reprogrammable components not mentioned Table 2. The List with Specified Details 3.VHDL Based Methodology 8 Paper No. 4[5] suggests an alternative for codesign methodology which is based on coloured Petri net model[13,14]. Thanks to the VHDL s descriptive ability, the system functions are specified as concurrent processes in VHDL that interact. System functions are mapped onto separate physical units and then software processes. The iterative performence decomposition, hardware software partitioning, refinement, ....

T. Agerwala, "Putting Petri Nets to Work", IEEE Computer, 12, no. 12, ( December 1979 ), 85-94.

....transition, we say that transition is enabled. Any enabled transition may fire, removing one token from every input place, and depositing one token in each output place. Petri nets have been used extensively in the analysis of networks and concurrent systems. For a more complete introduction, see [1]. CPNs differ from PNs in one significant respect; tokens are not simply blank markers, but have data associated with them. A token s color is a schema, or type specification. Places are then sets of tuples, called multi sets. Arcs specify the schema they carry, and can also specify basic boolean ....

Tilak Agerwala. Putting petri nets to work. Computer, pages 85--94, December 1979.

.... used in the formal specification of Algol 60 [24] and Pascal [6] A more recent technique using Evolving Algebras developed by Gurevich [21] has been widely used in the specification of Ada [35] C [22] C [51] and Modula 2 [23] Other popular techniques include Higher Order Logic and Petri Nets [2] which are discussed in greater detail in the next section. Almost all of the above techniques have been used in the specification of the semantics of VHDL. However, the motivation for formalizing the semantics of VHDL has not been merely to clarify its semantics but also to provide a basis for ....

....In some ways, this is similar to the work presented in this thesis in that the semantics is presented as an ordering of events over time intervals. The key difference is of course in the style being used (operational versus declarative) 2.2.3 Petri Nets Petri Nets, developed by C. A. Petri [2], are powerful graphical schemes useful in modeling systems that exhibit concurrency and whose components show complex interactions and behaviors. Petri Net models of systems can be analyzed for behavior using Petri Net theories. For example, a net corresponding to a VHDL description can be ....

Agerwala, T. Putting Petri Nets to Work. Computer 12, 12 (December 1979), 85--94.

....that need to be verified. These conditions are then proven using the Larch Prover. Properties of some simple circuits consisting of both combinational and state holding devices have been proven. 2. 5 Petri Nets A Petri Net is a graphical and mathematical modeling tool introduced by Petri [2]. Petri Nets are a promising tool for describing and studying systems that are characterized as being concurrent, asynchronous, distributed, parallel, nondeterministic, and or stochastic. As a graphical tool, Petri Nets can be used as a visual communication aid similar to flow charts, block ....

....in presenting user readable proofs [47] The PVS prover uses sequent calculus to manipulate and prove lemmas and theorems. A sequent of the form 2 The term PVS prover may be misleading. It is mainly a proof checker. f 1g Gamma 1 f 2g Gamma 2 [ 3] Gamma 3 . f1g Delta 1 [2] Delta 2 [3] Delta 3 . intuitively reads as ( Gamma 1 Gamma 2 Gamma 3 Delta Delta Delta) Delta 1 Delta 2 Delta 3 Delta Delta Delta) where each Gamma i is termed an antecedent formula and each Delta i is termed a consequent formula. One can easily see that a sequent is ....

Agerwala, T. Putting Petri Nets to Work. Computer 12, 12 (December 1979), 85--94.

.... are used to develop a mathematical representations of systems and apply these models to study the behavior and analyze the performance of systems [35, 36] We have proposed to represent data derivation processes with PNs [20] The advantages of this approach to model the derivation process are [3, 10, 26, 36]: ffl The graphical representation of Petri nets is not only easy to understand but has a well defined semantics which, in an unambiguous way, defines the behavior of the system. ffl PNs have proven to be very useful to describe pieces of intended system behavior where process synchronization is ....

....generating one token in C. The effect of firing a transition is illustrated in Figure 2. PNs evolved to overcome the limitations of finite state machines [36] Some of the application areas of PNs are in performance analysis [23, 46, 52] communication protocols [49] asynchronous systems modeling [3, 39], hardware modeling [6, 34, 19] and in hypertext systems [38] among others. Different properties of PNs have been investigated as analysis tools, including boundedness, conservation of tokens, safety, liveness of transitions [36] and invariants [30] The implications of the concept of liveness ....

[Article contains additional citation context not shown here]

T. Agerwala, "Putting Petri Nets to Work," IEEE Computer Magazine, pp. 85--94, Dec. 1979.

....when pre emption occurs. There have been several kinds of Petri nes researched over the recent three decades since their formulation by C. A. Petri in 1962. Some of the introductory articles on the different Petri net kinds are: ordinary Petri nets by Peterson (1981) this a good text book) Agerwala (1979), Burkard (1981) Celko (1984) and Johnsonbaugh and Murata (1982) coloured Petri nets by Jensen (1981) timed Petri nets by Zuberek (1980, 1986 and 1987) Holliday and Vernon (1987) Razouk and Phelps (1984) Maggot (1984) and Saukkonen (1983) numerical Petri nets by Symons (1980) and an ....

AGERWALA, T. (1979): Putting Petri nets to work. Computer, vol. 12, no. 12, pp 85-94.

....version of the classical Petri net model. This approach has been used to model and analyse a variety of systems in application domains ranging from logistics to office automation. Keywords: high level Petri nets; applications of Petri nets 1 Introduction The article Putting Petri Nets to Work ([9]) written by Agerwala, appeared in 1979. In this article Agerwala argues that: Today s modeling tools, appropriate for conventional sequential systems, will be inadequate for the complex concurrent systems of the 80 s. Petri nets may offer a solution. Since then Petri nets have become a ....

....sequential systems, will be inadequate for the complex concurrent systems of the 80 s. Petri nets may offer a solution. Since then Petri nets have become a popular tool for describing and studying concurrent systems. Nevertheless, we believe that the classical Petri net model described in [9] will be inadequate for the complex industrial systems of the 90 s. Therefore, we propose a Petri net model extended with colour , time and hierarchy . Automated systems encountered in the fields of logistics, manufacturing, communication and administration have become more complex in the last ....

[Article contains additional citation context not shown here]

T. Agerwala. Putting Petri Nets to Work. IEEE Computer, 12(12):85--94, Dec 1979.

....we consider an abstract shared memory architecture, comprising P = 2 processors, connected to a shared memory through some interconnection network. Apart from executing multiply and add, each processor can load from shared memory and store to shared memory. a 2 a 3 a 0 a 1 8 2 [2] 1 [1] 3 [1] 4 [2] 5 [1] 6 [2] 7 [1] 1, 2, 3, 4, 6: mult 5, 7, 8: add y x x [2] Figure 2.16: Annotated task graph of Eq. 1.1 for P = 2 Consider the polynomial example computation with P = 2 processors. As described earlier, scheduling for P = 2 results in the mapping as illustrated by the annotated ....

....we consider an abstract shared memory architecture, comprising P = 2 processors, connected to a shared memory through some interconnection network. Apart from executing multiply and add, each processor can load from shared memory and store to shared memory. a 2 a 3 a 0 a 1 8 2 [2] 1 [1] 3 [1] 4 [2] 5 [1] 6 [2] 7 [1] 1, 2, 3, 4, 6: mult 5, 7, 8: add y x x [2] Figure 2.16: Annotated task graph of Eq. 1.1 for P = 2 Consider the polynomial example computation with P = 2 processors. As described earlier, scheduling for P = 2 results in the mapping as illustrated by the annotated task ....

[Article contains additional citation context not shown here]

T. Agerwala, "Putting Petri nets to work," Computer, Dec. 1979, pp. 85--94.

No context found.

T.Agerwala, "Putting Petri Nets to Work," IEEE Computer , Vol.12, No.12, pp.85-94, Dec.1979.

No context found.

T. Agerwala, `Putting Petri nets to work', IEEE Comput., December 1979, pp. 85--94.

No context found.

T. Agerwala, "Putting Petri Nets to Work," IEEE Computer Magazine, pp. 85-94, Dec. 1979.

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