Reisig, W. (1992), A Primer in Petri Net Design, Springer Verlag.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....how to use guards and deadline of action together to trigger reactive module. The pro active detection algorithm is specified in Algorithm 2, w denotes a contract constraint scheme, a, b are actions, a, b w; a. t indicates the deadline of action a; we use Petri Net to overview a business process[28][16] 41] 42] the places correspond to states or each party and transitions correspond to actions of di#erent parties, M0 be a initial marking of Petri Net. When an action is attempted, if the guard of the action evaluates to this action can occur immediately, the rest of actions will be ....

Wolfgang Reisig. A primer in Petri net design. Springer-Verlag, 1992.

....of a test environment. This will then be applied to the performance evaluation of a very simple example system. Finally, we discuss the results and give an outlook for further work in this area. Figure 1: A parametric binary operator component. 2 DYNAMIC AND PARAMETRIC PETRI NETS Petri nets [11, 13] are a notation for modeling concurrent systems which combine a solid formal underpinning with an intuitive visual appearance. They have been extended in various ways in order to make them more suitable for real world modeling tasks, in particular by adding concepts such as time (e.g. 10, 2, 8, ....

Wolfgang Reisig. A Primer in Petri Net Design.

....orders on alarms. To translate a Petri net of capacity one into a 1 safe net, simply add a complement to every place in the fault net. For a place p 2 P of the fault net, p is the complement of p if ffl p = p ffl ; p ffl = ffl p and M 0 (p) 1 as initial marking. As Reisig marked out in [20], this is a convenient way to make the ability of a transition to fire dependent only on its pre set. And the behavior of the considered net is left unchanged. Figure 7 illustrates the expansion of an alarm pattern. On top of the figure an alarm pattern A is given, looking like one of the LOS ....

W. Reisig. A Primer in Petri Nets Design. Springer-Verlag, 1992.

.... and behaviour properties related to concurrency, and on the other hand, because their theoretical foundation leads to numerous analysis tools (reachability graph, invariant calculus, 13] In order to have a more concise representation, high level Petri net models have been proposed [5, 10, 14]. In these formalisms, tokens can be identified; those causing the same behaviour are defined as elements of the same type, and labels on arcs specify how they are processed. Numerous techniques have been defined for the analysis of high level Petri nets, namely the computation of the ....

: W. Reisig. "A Primer in Petri Net Design", Springer Verlag, 1991.

....solving environment ABSYNT (Mbus et.al. 1994; 1995) But there are similarities to the domain of parallel programming. Another source of problems for novices is the fact that there are not many approaches to support Petri net design in a systematical way. Even in introductory textbooks (e.g. Reisig, 1985; 1992), Petri nets tend to be presented as ready made solutions to modelling tasks described informally, but there is no clear cut methodology for their construction. Furthermore, we think that students need to have an opportunity to practice design and problem solving in the net domain. So a ....

Reisig, W. (1992). A primer in Petri net design. Berlin: Springer.

.... software engineering domain this observation led to the recent trend of using software design patterns (Buschmann and Meunier 1995; Gamma et al. 1995) Our experience with Petri nets, an established and well researched visual language for systems modeling, simulation, and analysis (Murata 1989; Reisig 1992; Zurawski and Zhou 1994) in projects concerned with modeling of manufacturing machines (Esser, Janneck, and Naedele 1997; Naedele and Janneck 1998) and integrated circuits (Gries 1998) shows that patterns are very useful in this area as well. In this paper we continue work presented in (Naedele ....

....work presented in (Naedele and Janneck 1998) describing a template to capture, document, and present design knowledge in the form of design patterns. Finally, the example of the modeling of an integrated circuit shows an application of that template. 1 INTRODUCTION Petri nets (Murata 1989; Reisig 1992), Zurawski and Zhou 1994) are an established visual formalism that can be applied in various domains such as economics, mechanics, work flow organisation, theoretical computer science, and hardware as well as software design of complex concurrent computer systems. Petri nets are chosen for these ....

[Article contains additional citation context not shown here]

Reisig, W. (1992). A Primer in Petri Net Design. Springer-Verlag.

....Section 5 the proposed method is illustrated using the dissolving process benchmark example [4] The paper concludes with an outlook on further work. 2. THE CONTROL DESIGN PROCESS In Figure 1 the control design process is analyzed. The presentation form is a Channel Agency Net, see e.g. Reisig [5]) depicting the design process. Some terms which are often used with varying meanings in the area of logic control are explained. In almost all cases, the designer of a logic control system starts with a given informal specification of the control problem. The term informal refers to everything ....

W. Reisig, A Primer in Petri Net Design, Berlin, Heidelberg, New York, Springer, 1992.

....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 ....

Wolfgang Reisig. A Primer in Petri Net Design. Springer-Verlag, 1992.

....Motivations to merging Petri nets and objects, used approach, and a brief description of PNtalk is presented in the paper. MOTIVATIONS Petri nets, especially high level ones (Colored Petri Nets, CPN) are popular formalism for modeling of concurrent systems (Peterson 1981; Jensen 1991; Reisig 1992). Petri nets have some interesting features, such as intuitive understanding, graphical representation and simplicity, besides their rigorous formal nature which allows formal reasoning. Moreover, their executability makes them very suitable for simulation, rapid prototyping, and ....

Reisig, W. 1992. A Primer in Petri Net Design.

....on Software Engineering, Vol. SE 1(2) June 1975, pp. 220 232. 195] Rasmussen, J. Diagnostic Reasoning in Action , IEEE Transactions on Systems, Man and Cybernetics, Vol. 23, No. 4, July 1993, pp. 981 992. 196] Reisig, W. Petri Nets: An Introduction , Springer Verlag, Berlin, 1985. [197] Reisig, W. A Primer in Petri Net Design , Springer Compass International, Springer Verlag, Berlin, 1992. 198] Remy, P. A. Lewis, A. H. and Jin, V. Y. On the Design of Distributed Organizational Structures , Tech. Rep. LIDS P 1581, MIT. 199] Rozenberg, G. Ed. Petri Nets in Flexible ....

Reisig, W., "A Primer in Petri Net Design", Springer Compass International, Springer--Verlag, Berlin, 1992.

....with values 0 or 1. To translate a Petri net of capacity one into a 1 safe net, simply add a complement to every place in the fault net. For a place p 2 P of the fault net, p is the complement of p if ffl p = p ffl ; p ffl = ffl p and M 0 (p) 1 as initial marking. As Reisig marked out in [24], this is a convenient way to have transition firings to depend only on their respective pre sets. And the behavior of the considered net is left unchanged. To strictly limit the model to 1 safe Petri nets, alarm patterns are expanded onto 1 safe nets. Let A be an alarm pattern. The corresponding ....

W. Reisig. A Primer in Petri Nets Design. Springer-Verlag, 1992.

....the protocol for each object. 4c. Develop a process model which elaborates on the internal actions performed by each object in response to the receipt of a message. This produces the specifications for the methods of each object. With regard to the use of petri nets for modelling complex systems, Reisig (Reisig 1992) has examined the various levels of detail possible with different petri net formalisms, and has presented rules for petri net construction that are comparable to conventional rules for well structured procedural programs. Vogler (Vogler 1992) has considered the modular construction of safe nets, ....

.... modelling tools, such as StateTransition (Rumbaugh 1991) or Life Cycle Activity diagrams (Hutchinson 1975) These tools conveniently represent the dynamic behaviour of each object as a whole, and can be readily translated into petri subnets using the condition event representation technique (Reisig 1992). That is, each state or condition is represented as a place and each event or transition is represented as a transition. The life cycle of an object is then represented as a petri net where the current state of the object is represented by the placement of a single token within that net. Where ....

[Article contains additional citation context not shown here]

Reisig, W.A. 1992. A Primer in Petri Net Design.

....the coordinator detects all the possible clone generation by any agent server. Subsection 5.1 introduces the basic concept and definitions of CP nets, subsection 5.2 describes the important declarations of the model and subsection 5.3 describes the net structure. 5.1. CP nets Basics Petri nets[10, 11, 12, 13] provide a graphical and mathematical modeling tool applicable to many systems. They are promising tools for describing and studying information processing systems that are characterized as being concurrent, asynchronous, distributed, parallel, nondeterministric, and or stochastic. As a graphical ....

....called a marking which represents current state of the net. A transition is enabled when each of its input places contains at least one token. When a transition fires, it removes one token from each input place and puts a token to each output place. For the details of ordinary Petri nets, refer to[12, 13]. On the other hand, high level nets[10, 11] such as CP nets and Pr T nets, are now in widespread use for many different practical purposes. The main reason for the great success of these kinds of net models is that they have a graphical representation and a well defined semantics allowing formal ....

[Article contains additional citation context not shown here]

Wolfgang Reisig, "A Primer in Petri Net Design," Springer-Verlag, 1992.

....exists a rather small body of recurring examples to illustrate certain behaviors of a net that can very well be called patterns. However, the problem with those particular examples like deadlock (e.g. 2, 19] dining philosophers (e.g. 19, 14, 3] producer consumer and reader writer (e.g. [2, 19, 14, 20, 21]) etc. is that, while they do illustrate their particular theoretical point, the style of presentation used is not intended to show how to integrate those examples into models of real systems. The idea of general purpose building blocks is hinted at in [9] but the authors of this case study do ....

W. Reisig. A Primer in Petri Net Design. Springer-Verlag, 1992.

....LOOPN are discussed with respect to its use in the dynamic modelling of information systems. 1. Introduction Petri Nets have been popular as a formal modelling technique and a practical tool for the description, analysis and simulation of concurrent computer systems (Jensen 1990; Reisig 1985; Reisig 1992). Much of the work on petri nets has focussed on their mathematical properties and their ability to accurately model components of systems. Relatively little work has been undertaken on scaling up petri net specification schemes to conveniently and elegantly represent large, complex information ....

Reisig, W. 1992. A Primer in Petri Net Design. Springer-Verlag, Berlin.

....detects occurrence of in the event register inform the component for the detection of composite events a. what happens after the event rule definition b. what happens after an event occurs event , rulebase 8 4.1. 2 Detecting Composite Events Using Petri Nets In SAMOS, we use Petri nets (PN) [15] to model and to detect composite events. Incidentally, Petri nets have been used for active databases for the modelling of the active behavior during the database design process [14] In the context of SAMOS, we define a PN as a tuple (N,M o ) where N represents the (static) structure of the PN ....

Reisig W. A Primer in Petri Net Design. Springer Verlag, October

....Again, complexity needs to be clarified. The formalism has only four constructs so complexity arises not from that number, but rather from their excessive and repetitive use. These deficiencies were addressed with the introduction of coloured Petri nets and also hierarchical coloured Petri nets (Reisig 1991). The extension of the theory allowed for coloured tokens and complex algorithmic rules (op. cit. to control the flow structure of the net. The rules supplemented and extended the notion of enabling and firing rules. Rules could now be far more complex. The result was that nets were no longer ....

Reisig, W. (1991) A Primer in Petri Net Design, Springer-Verlag, Berlin.

....exists a rather small body of recurring examples to illustrate certain behaviors of a net that can very well be called patterns. However, the problem with those particular examples like deadlock (e.g. 2, 21] dining philosophers (e.g. 21, 15, 5] producer consumer and reader writer (e.g. [2, 21, 15, 22, 23]) etc. is that, while they do illustrate their particular theoretical point, the style of presentation used is not intended to show how to integrate those examples into models of real systems. The idea of general purpose building blocks is hinted at in [10] but the authors of this case study do ....

Wolfgang Reisig. A Primer in Petri Net Design. Springer-Verlag, 1992.

....and is derived from a program code testing concept, the so called cause effect graphing. As an extension of the concept, a method for test data generation is demonstrated. 1. INTRODUCTION High level Petri nets are a widely used modeling and specification language for information system behavior [10]. They combine the advantages of a simple graphical notation with mathematical foundation. Moreover, they allow to model the behavior of an information system and its data structures in one integrated scheme [7] Petri nets are directly executable by a net interpreter. Thus, Petri net simulation ....

W. Reisig, A Primer in Petri Net Design, SpringerVerlag, 1992.

No context found.

Reisig, W., A Primer in Petri Net Design, Berlin: Springer 1992.

No context found.

Reisig, W. (1992), A Primer in Petri Net Design, Springer Verlag.

No context found.

Wolfgang Reisig. A Primer in Petri Net Design. Springer-Verlag, 1992. based on a German edition.

No context found.

Reisig, W.: A Primer in Petri Net Design. Springer-Verlag 1992.

No context found.

Reisig, W. "A Primer in Petri Net Design", Springer Verlag 1992.

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