James L. Peterson. Petri net theory and the modeling of systems. Prentice-Hall, 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....X rays and video scans that need to be protected from unauthorized personnel. At the same time fast and efficient access to specific patient information by a physician may be very critical. Petri Net model has been found very useful in modeling concurrent computation and complex processes[2]. It has been extended in Generalized Object Composition Petri Net (GOCPN) to model multimedia synchronization[3] 4] 5] 6] Several security models have been proposed and applied for developing secure computing systems[7] Access control mechanism is broadly categorized as discretionary access ....

....the proposed colored GOCPN. In section 5 we conclude with a discussion on future research. 2. 0 Petri Net models of Multimedia Petri nets have been widely used for modeling and analysis of systems that are characterized as being concurrent, asynchronous, distributed, parallel and nondeterministic[2][9] Various factors contributing to their success include their graphical nature, the simplicity of the model and the firm mathematical foundation. It also provides modularity in design. Time intervals can be used to describe the presentation of multimedia documents. There are all together 13 ....

James L. Peterson, "Petri net theory and the modeling of systems", Prentice-hall, 1981

....to allow a Markov chain analysis. If the times have a general distribution, semi Markov analysis or simulation would be needed [Bechta84a] 4 Stochastic Petri Net A Petri net is a graphical model useful for modeling systems exhibiting concurrent, asynchronous or nondeterministic behavior [Peterson81]. The nodes of a Petri net are places (drawn as circles) representing conditions, and transitions (drawn as bars) representing events. Tokens (drawn as small lled circles) are moved from place to place when the transitions re, and are used to denote the conditions holding at any given time. As ....

....nition, so we will use the term stochastic Petri net (SPN) with the generic meaning of Petri net with stochastic timing . Three additional features to control the enabling of transition are included in our SPN model: inhibitor arcs, transition priorities, and enabling functions. An inhibitor arc [Peterson81] from a place to a transition disables the transition if the corresponding input place is not empty. If several transitions with di erent priorities are simultaneously enabled in a marking, only the ones with the highest priority are chosen to re, while the others are disabled. An enabling ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Clis, NJ, USA, 1981.

....with transitions and how final states are defined. For this paper, we assume that whenever a transition is fired, whether it thereby creates a debt or not, the symbol mapped to the transition is added to the string being generated. 2 In this case, the three methods described by Peterson [5] 1 By convention we define D(s) to be a constant 0 for any s that is not the source of a debit arc. Having D be a total function is a convenience, and saves a change of notation in later extensions to these early definitions. 2 There are other possibilities one might consider. For instance, a ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., 1981.

....example, istate is f(P; x] g and trel is f( P; x] a y; Q; x; y] Q; x; y] b (f x y) P; y] g A state is a pair (pname; dpsvar) where pname is control state and the list of variables dpsvar holds the data state. The execution semantics of a HFG are similar to that of a Petri net [Pet81] A transition (pr; ac; po) 2 T ransition is said to be enabled if the execution of the system reaches the states denoted by pr. Then the system performs actions ac and the execution reaches the states denoted by po. The time associated with an action is unspecified. As in Petri nets, more than ....

....by hopCP syntax are shown to be one safe. 3.2.1 Relationship with Petri Nets and One Safety There is a close similarity between Petri nets and the hopCP Flow graphs. The basic hopCP flowgraphs defined without using the k operator correspond to finite state machines in the Petri Net terminology [Pet81] Note that a state machine is a Petri net in which each transition is restricted to having exactly one input and one output. The only dif11 ference is the presence of compound actions which introduce local fork join structures and support restricted form of non interfering parallelism. With ....

James L. Peterson. Petri Net Theory and The Modeling Of Systems. Prentice-Hall, 1981.

....the corresponding incoming invoice in step z (and its successors) Following the conventional use of the term concurrency that is associated with the AND control flow in distributed software, the y and z parts of the procedure might be executed simultaneously or in either order. A Petri net [35, 36] is a control flow model that explicitly represents sequence, ORflow, and AND flow, thus Petri nets (or their logical equivalent, again see [34] are often the underlying coordination model in a workflow language. In general, a workflow coordination model can be defined as a directed graph, N, ....

....sufficient, they can sometimes be difficult to use to represent a specific situation, e.g. where one would like to fire a transition if a condition is false rather than true. In the Petri net research community, this problem was addressed by adding inhibitor arcs in some variants of the language [36]. Some users continue to feel unduly constrained by the language syntax, though their concerns can sometimes be addressed by revising the syntax of the underlying model [37] Handling Detail. Workflow modeling languages are frequently visual to enhance their utility, causing scaling to be a ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., 1981.

....are based on the inter leaving of atomic actions. This interleaving and atomicity assumptions have the drawback of not properly expressing concurrency in a physically distributed framework. A third and more useful option for a physically distributed analysis of a parallel language are Petri Nets [27, 29]. The following subsections in turn models our Linda Calculus by use of respectively SOS, CCS and Petri Nets. 3.1 Structured Operational Semantics for the Linda calculus Following Plotkin s SOS style, we give a set of rules defining the operational semantics of the Linda Calculus in a simple ....

James Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall, 1981.

....mathematical prerequisites in Sect. 2. In Sect. 4, we generalize this result to extended asymmetric choice nets and discuss some limitations. 2 Basic concepts Now, we introduce and formalize the basic concepts. In Sect. 2. 1, we present concepts from Petri net theory which are all well established [13, 14, 7, 9]. In Sect. 2.2, we present computations, fair computations, and the concept of recurrence, which are not standard in Petri net theory. 2.1 Petri nets A Petri net consists of a nite set of places P , a nite set of transitions T , and a ow relation F which relates transitions and places. A ....

James L. Peterson. Petri Net Theory And The Modeling of Systems. Prentice-Hall, 1981.

....mathematical prerequisites in Sect. 2. In Sect. 4, we generalize this result to extended asymmetric choice nets and discuss some limitations. 2 Basic concepts Now, we introduce and formalize the basic concepts. In Sect. 2. 1, we present concepts from Petri net theory which are all well established [13, 14, 7,9]. In Sect. 2.2, we present computations, fair computations, and the concept of recurrence, which are not standard in Petri net theory. 2.1 Petri nets APetri net consists of a finite set of places P,a finite set of transitions T , and a flow relation F which relates transitions and places. A ....

James L. Peterson. Petri Net Theory And The Modeling of Systems. Prentice-Hall, 1981.

....SubEnv checks whether there are further Summits pending, in which case it starts another Summit, or if no more Summit rules are pending the (multi rule) Summit is completed. Since the Oz PML is rule based, we defer further discussion of rules to Chapter 4. 3.5. 2 Petri Nets The Petri net [86] is a powerful formalism for modeling concurrent systems, and it has been widely applied to software process modeling. The application of our decentralized model to Petri net based PCEs is influenced primarily by SLANG [3] and FUNSOFT [39] and their corresponding PMLs SPADE and MELMAC, ....

James L. Peterson. Petri Net Theory and The Modeling of Systems. PrenticeHall, Englewood Cliffs NJ, 1981.

....as APPL A can be found in [7] These families, together with rules, cover most kinds of PSEE [33] Since we take the existing PMLs as given, the uninitiated reader should see the cited references for background and justification of each approach to process modeling. 4. 1 Petri Nets The Petri net [45] is a formalism for modeling concurrent systems, and it has been widely applied to software process modeling. The application of our decentralized model to Petri net based PSEEs is influenced primarily by SLANG [2] and FUNSOFT [21] and their corresponding PSEEs, SPADE and MELMAC, respectively. ....

James L. Peterson. Petri Net Theory and The Modeling of Systems. Prentice-Hall, Englewood Cliffs NJ, 1981. 51

....If this process fails to converge or converges slowly, the designer can also increase the tolerance factor to account for the routing delays. The complete circuit can then be simulated in different ways as discussed in Section IV. III. THE SPECIFICATION MODEL An STG corresponds to a Petri net [8], 2] A Petri net is a directed graph with two different types of vertices: places (open circles) and sending sending reqrcv rjsend sending acksend rejsendacksend enwoq reqrcvenwoq reqrcvenwoq reqrcvenwoq p4 p1 p5 p6 p7 p9 p8 p10 p11 p12 p13 p0 p2 p3 Fig. ....

James L. Peterson. "Petri Net Theory and the Modeling of Systems". Prentice-Hall, 1981.

....generation by entering into the determination at each NFA state of the possible successors for that state. This procedure is very similar to the previously mentioned NFA toDFA construction algorithm; it is also essentially the same procedure used to generate the coverability graph of a Petri net [10], which, for bounded nets, can be thought of as a deterministic finite automaton. The NFA shown in figure 3 was generated by this construction and is equivalent to the PFA in figure 2. The states of the NFA have been named to correspond to the active PFA nodes each represents. 7 Figure 4: ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., 1981.

....36 Priority Exchange Server . 38 7.3 Preemptive EDF Scheduling . 40 7.4 Other Scheduling Policies . 40 8 Conclusion 41 References 42 2 1 Introduction Petri nets [32, 34, 38] are increasingly used for the evaluation and analysis of real time systems [9, 5, 4, 8, 35, 16, 17, 33] Real time systems are systems for which both functional correctness and timing correctness need to be guaranteed in order to achieve the intended purpose. Petri nets are a powerful ....

....macros for the the operations of the layer below. The different layers are connected implicitly by transition superposition. 4 Petri Nets 4.1 Basic Formalism This report assumes that the reader is familiar with Petri nets in general. Introductory material about Petri nets can be found e.g. in [32, 34, 38, 39, 53]. The Petri net formalism used is a so called high level Petri net similar to the ER nets of [16] that is, tokens can carry arbitrary data values, and expressions can be evaluated using the data values carried by tokens. Expressions can contain the usual mathematical operations and control flow ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall, 1981.

....problems seen in data integration, concurrent and asynchronous behavior often extant and useful in distributed and database systems, and event detection and temporality. Petri nets offer many analysis techniques applicable to data integration, including reachability, coverability, and boundedness [23]. Variants of the general Petri net model have proven useful for the modeling of composite event detection and active database systems architectures [15, 19] and the specification and verification of distributed databases and software systems [5, 29] The particular variant of Petri nets we use ....

....fault tolerance of a running data integration solution. 4. The Souk Network Specification Model Our specification model for data integration is the Souk Net (SNet) a variant of WorkFlow Nets (WoFNets) designed to model data integration process flows. WoFNets are a class of Colored Petri nets [23]. This class of Petri nets has been used by Ellis and Keddara to model workflow processes and dynamic change in them [13] An SNet is a bi partite net with two kinds of nodes, places and transitions. They are colored in the sense that the tokens in an SNet can be assigned color types to indicate ....

James L. Peterson. Petri Net Theory and The Modeling of Systems. Prentice-Hall: Englewood Cliffs, NJ. 1981.

....and each alternative or extension is proved to preserve the consistency. Thus, all developed models cannot have control flow anomalies. 2 Behavioral Consistency of B.P. Models Petri nets are commonly used in the literature to model and analyze data, behavior, and performance of business processes [9, 14, 13]. We do not advocate the direct use of Petri nets for process modeling as in [5] nor do we want to define a behavioral model for COPA directly as in CICN [5] Instead, we let the user deal with COPA and define the behavior of A = fin; cust appl ; credit appr ; mortgage appr ; inform; out ; errg ....

James L. Peterson. Petri Net Theory and The Modeling of Systems. Prentice-Hall Inc., 1981.

....place. A place containing one or more tokens is said to be marked. When each place incident on a transition is marked that transition is enabled. An enabled transition may fire 1 Readers unfamiliar with basic net theory can find a thorough exposition in the books by Reisig [Rei85] and Peterson [Pet81], and in the survey paper by Murata [Mur89] Figure 1: Screen from ffTrellis showing an image browsing index. by removing one token from each of its input places and putting one token into each of its output places. The full token distribution among places is the state of the net and is termed a ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., 1981.

.... and Habermann s classical work on path expressions for describing process behavior in operating systems [Campbell 74] We have classified DPEs into five subclasses according to syntactic criteria, and characterized the semantics of each subclass using a hierarchy of extended Petri net models [Peterson 81] see Fig. 1 3) Extended Petri nets are equivalent to Turing machines [Hack 75, Thomas 76] The characterization demonstrates the power of DPEs for modelling true concurrency. In this paper, the third subclass, safe DPEs, will be proved equivalent to k safe Petri nets. DPEs were originated for ....

....when all B events in the concurrent threads are complete, then C occurs; note that C can occur while the number of non processed B s is tested equal to zero, because of the concurrent closure operator. This expression cannot be described by a Petri net, but is expressible by an extended Petri net [Peterson 81] The fifth subclass of DPEs, extended DPEs, allows an event causally succeeding an unknown (unbounded) number of concurrent events, as modeled by extended Petri nets. For example, enq ; update) deq ; display represents the case where an unbounded number of signals arise and each signal ....

James L. Peterson. Petri Net Theory and The Modeling of Systems. Prentice-Hall, Inc., Englewood Cliffs, NJ 07632, 1981.

....activated for some time. For example, consider the DS qualifier is used with delayed time of 4 seconds. If the associated step is deactivated within 4 seconds, the actions won t be executed at all. 4 Comparison with Petri net As said, sequential function charts are very much based on Petri net [3]. Petri nets were developed by Carl Adam Petri for describing the causal relationships between events. Petri nets are used for modelling systems with interacting concurrent components. We will now look at a definition of a Petri net which shows very much resemblance with SFC [2] A Petri net ....

James L. Peterson, Petri net theory and the modeling of systems, Prentice-Hall Inc, Englewood Cliffs, N.J. 07632, 1981.

....to allow a Markov chain analysis. If the times have a general distribution, semi Markov analysis or simulation would be needed [Bechta84a] 4 Stochastic Petri Net A Petri net is a graphical model useful for modeling systems exhibiting concurrent, asynchronous or nondeterministic behavior [Peterson81]. The nodes of a Petri net are places (drawn as circles) representing conditions, and transitions (drawn as bars) representing events. Tokens (drawn as small filled circles) are moved from place to place when the transitions fire, and are used to denote the conditions holding at any given time. ....

....so we will use the term stochastic Petri net (SPN) with the generic meaning of Petri net with stochastic timing . Three additional features to control the enabling of transition are included in our SPN model: inhibitor arcs, transition priorities, and enabling functions. An inhibitor arc [Peterson81] from a place to a transition disables the transition if the corresponding input place is not empty. If several transitions with different priorities are simultaneously enabled in a marking, only the ones with the highest priority are chosen to fire, while the others are disabled. An enabling ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs, NJ, USA, 1981.

....oriented and concurrent programming paradigms, where each entity in a PN is modelled as an agent an autonomous and active concurrent entity, which has its own behaviour and channels for interaction. Keywords: Petri Nets, Agents, Concurrency, Object Oriented, ECAD tools. 1 Introduction PNs [1, 2] proved to be an efficient methodology to model parallel discrete event systems. Safe PNs were chosen to realistically model the behaviour of digital systems. Modifications to the standard PN are proposed, to properly specify digital controllers. The resulting PNs are called Synchronous ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs, New Jersey, U.S.A., 1981.

....a color) 2) the net can accept a discrete input signal from outside the system (i.e. external events can occur) and 3) transitions can take an arbitrary amount of time (stochastic, timed network) Figure 5 shows a Petri net controller for this purpose. The Petri net, PN , is defined as follows [17]: ffl PNET = P; T; I; O ffl P = fp 1 ; p 5 g CIS TR93 003 TBP: J. Discrete Event Dynamic Systems 9 Hw=0 M6 M5 M4 M2 M3 M1 Heating I=OFF I=ON I=ON or I=OFF I=OFF I=ON I=OFF I=ON I=ON I=OFF I=ON Hw=0 Hf=Ht Underflow Overflow Cold T=100 Boiling Cooling a T= FSA FSA 1 2 Hw=0 M6 M5 M4 ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1981.

....a partial order of execution sequences among nodes. A marking is a function from arcs to the natural numbers. The control state of a GMB is a marking that represents the number of tokens in each arc at a given time. The control domain of the GMB has an expressive power equivalent to Petri nets [12]. ffl Data domain, which describes data flow. ffl Interpretation domain, which describes data types and the operations represented by nodes. GMB does not mandate a language for the interpretation domain (PL 1 and the Lisp dialect T have been used in the past) 1 Schemas in Z and objects in ....

....but not other shared locks. The constant N is the maximum number of processes simultaneously holding a shared lock on a resource. This constraint is intrinsic to the GMB (and Petri nets) notation because it is not possible to define a general unbounded solution to the readers and writers problem [12]. This limitation is pragmatically overcome by choosing a large N . 4.5.4 Interface, Enable and Close boxes The Interface box captures the gestures of the user, interpreting what operation he or she wants to execute, and puts a token in the corresponding arc to the Enable or the Close box ....

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs, N.J., 1981.

No context found.

James L. Peterson. Petri net theory and the modeling of systems. Prentice-Hall, 1981.

No context found.

James L. Peterson, Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc, Englewood Cliffs, New Jersey, 1981.

No context found.

James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc. 1981

First 50 documents

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