scholarly journals Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs

1992 ◽  
Vol 21 (398) ◽  
Author(s):  
Søren Christensen ◽  
Niels Damgaard Hansen

In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives - place capacities, test arcs and inhibitor arcs. The new modelling primitives are introduced to improve the possibilities of creating models that are on the one hand compact and comprehensive and on the other hand easy to develop, understand and analyse. A number of different place capacity and inhibitor concepts have been suggested earlier, e.g. integer and multi-set capacities and zero-testing and threshold inhibitors. These concepts can all be described as special cases of the more general place capacity and inhibitor concepts defined in this paper. We give an informal description of the new concepts and show how the concepts can be fonnally defined and integrated in the Petri net framework keeping the basic properties of CP-nets. In contrast to a number of the previously suggested extensions to CP-nets the new modelling primitives preserve the concurrency properties of CP-nets. We show how CP-nets with place capacities, test arcs and inhibitor arcs can be transformed into behaviourally equivalent CP-nets without these primitives. From this we conclude that the basic properties of CP-nets are preserved and that the theory developed for CP-nets can be applied to the extended CP-nets. Finally, we discuss how to generalise the analysis methods of CP-nets to cover the place capacities, test arcs and inhibitor arcs.

1998 ◽  
Vol 08 (01) ◽  
pp. 21-66 ◽  
Author(s):  
W. M. P. VAN DER AALST

Workflow management promises a new solution to an age-old problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the use of Petri nets in the context of workflow management. Petri nets are an established tool for modeling and analyzing processes. On the one hand, Petri nets can be used as a design language for the specification of complex workflows. On the other hand, Petri net theory provides for powerful analysis techniques which can be used to verify the correctness of workflow procedures. This paper introduces workflow management as an application domain for Petri nets, presents state-of-the-art results with respect to the verification of workflows, and highlights some Petri-net-based workflow tools.


Author(s):  
Hana Kubátová

The paper presents the principles of using Petri Net formalism in hardware design courses, especially in the course “Architecture of peripheral devices”. Several models and results obtained by student individual or group projects are mentioned. First the using of formalism as a modeling tool is presented consecutively from Place/Transition nets to Coloured Petri nets. Then the possible Petri Nets using as a hardware specification for direct hardware implementation (synthesized VHDL for FPGA) is described. Implementation and simulation results of three directly implemented models are presented.


1997 ◽  
Vol 7 (4) ◽  
pp. 359-397 ◽  
Author(s):  
JOSÉ MESEGUER ◽  
UGO MONTANARI ◽  
VLADIMIRO SASSONE

Place/transition (PT) Petri nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the ‘token game’ is too intensional, even in its more abstract interpretations in terms of nonsequential processes and monoidal categories; on the other hand, Winskel's basic unfolding construction, which provides a coreflection between nets and finitary prime algebraic domains, works only for safe nets. In this paper we extend Winskel's result to PT nets. We start with a rather general category PTNets of PT nets, we introduce a category DecOcc of decorated (nondeterministic) occurrence nets and we define adjunctions between PTNets and DecOcc and between DecOcc and Occ, the category of occurrence nets. The role of DecOcc is to provide natural unfoldings for PT nets, i.e., acyclic safe nets where a notion of family is used to relate multiple instances of the same place. The unfolding functor from PTNets to Occ reduces to Winskel's when restricted to safe nets. Moreover, the standard coreflection between Occ and Dom, the category of finitary prime algebraic domains, when composed with the unfolding functor above, determines a chain of adjunctions between PTNets and Dom.


1938 ◽  
Vol 32 (2) ◽  
pp. 233-243 ◽  
Author(s):  
Joseph Lockey

Pan-Americanism and imperialism appear to be mutually exclusive. Whether they are so in effect is a matter of definition. Neither term in current usage conveys a precise meaning. Pan-Americanism fails because it has not yet emerged into a distinct and easily recognizable form, and imperialism because it has evolved in the course of history through a variety of forms from which a doubtful choice must be made. In the one case the problem is to decide what meaning, and in the other, which meaning. The "what" is the more difficult to determine, since new concepts such as Pan Americanism acquire meaning with time and circumstance. It is not strange, therefore, that the attempts at formal definition have thus far proved unsatisfactory. Not even the genus to which Pan-Americanism belongs has been agreed upon. One author calls it an advocacy, another an idea, another a sentiment, and sti l others an aspiration, a tendency, or a doctrine. Obviously it does not fall indifferently into all these categories. If it is a sentiment merely, it is less than a doctrine; if it is a doctrine it is more than a tendency; and to call it a tendency is not the same as to say it is an aspiration or an idea. Moreover, none of these classifications when considered separately seems to fit the case.


Author(s):  
Jason Bell ◽  
Rahim Moosa ◽  
Adam Topaz

The following theorem, which includes as very special cases results of Jouanolou and Hrushovski on algebraic $D$ -varieties on the one hand, and of Cantat on rational dynamics on the other, is established: Working over a field of characteristic zero, suppose $\unicode[STIX]{x1D719}_{1},\unicode[STIX]{x1D719}_{2}:Z\rightarrow X$ are dominant rational maps from an (possibly nonreduced) irreducible scheme $Z$ of finite type to an algebraic variety $X$ , with the property that there are infinitely many hypersurfaces on  $X$ whose scheme-theoretic inverse images under $\unicode[STIX]{x1D719}_{1}$ and $\unicode[STIX]{x1D719}_{2}$ agree. Then there is a nonconstant rational function $g$ on $X$ such that $g\unicode[STIX]{x1D719}_{1}=g\unicode[STIX]{x1D719}_{2}$ . In the case where $Z$ is also reduced, the scheme-theoretic inverse image can be replaced by the proper transform. A partial result is obtained in positive characteristic. Applications include an extension of the Jouanolou–Hrushovski theorem to generalised algebraic ${\mathcal{D}}$ -varieties and of Cantat’s theorem to self-correspondences.


2014 ◽  
Vol 7 (13) ◽  
pp. 133-139
Author(s):  
Iulian Dumitru ◽  
Florin Nichifor

Abstract Marketing developed close relation with sponsorship since the beginnings of the industrial era of sports. The relation has transformed in a stable relation, the two forces - the sponsor and the sponsored - transforming into two companions of journey. The effort undertaken in this work was focused on analyzing the modern aspects of the partnership generated through sports sponsorship.The current issue and sport sponsorship has come a long way since the first action of its kind until now. Based on the presentation of new concepts on the development efforts in sport sponsorship, content provides a detailed analysis of the actual specifics of this type of activity. Analysis of influence vectors sponsorship process gives us a picture of the forces that can act on this. At the end of our research we focused attention on elements that empowers sports portfolio in terms of corporate interest, the potentiation commercial message and image association. This technique of promotional community for and through sports is maybe the one that manifests the most “laic” status among the promotional forms. This epithet implies a metaphorical approach given by the possibility of accomplishing some objectives that can have some more obvious “corporality” than in the case of the other forms of promotion used in the sports industry. Sports sponsorship has been an early ally of sports, and has remained a basic communicational technique. This fact is due to some determination in double sense: on the one hand, sport has adapted permanently to the dynamics of the range of sponsorship techniques and, on the other hand, the sponsorship tried to use the chameleon-like offer of the sports potential.


2010 ◽  
Vol 97-101 ◽  
pp. 2444-2448
Author(s):  
Feng Ying Li ◽  
Tian Long Gu ◽  
Liang Chang

Algorithms based on timed Petri net are competitive for solving the problem of assembly sequence planning (ASP). In order to alleviate the state-space explosion problem which is caused by the Petri net-based representation of assembly sequences and to improve the efficiency of planning algorithms, an approach based on ordinary binary decision diagrams (OBDDs) is presented in this paper. On the one hand, all the timed transitions in Petri nets are substituted by some technically designed timed transition structures; on the other hand, Petri nets used in algorithms of assembly sequence planning are represented symbolically as OBDDs. As a result, a novel assembly sequence planning algorithm based on symbolic OBDDs is presented. With the help of OBDDs, both the marking vectors and the states of Petri nets are formulated more compactly; at the same time, the searching processes can be manipulated implicitly. Therefore, compared with original algorithms, both the time performance and the space performance are improved.


1985 ◽  
Vol 14 (197) ◽  
Author(s):  
Kurt Jensen

<p>This paper describes a Petri net model, where information is attached to each token and when a transition fires, it can inspect and modify the information. The model is based on predicate/transitions (Genrich and Lautenbach) and on coloured Petri nets (Jensen).</p><p>This generalization of ordinary Petri nets allows, for many applications, more manageable descriptions, due to the fact that equal subnets can be folded into each other yielding a much smaller net. The paper investigates how to analyse high-level Petri nets, and it turns out that invariants and reachability trees, two of the most important methods for ordinary Petri nets, can be generalized to apply for high-level Petri Nets.</p>


1992 ◽  
Vol 21 (390) ◽  
Author(s):  
Søren Christensen ◽  
Niels Damgaard Hansen

<p>This paper shows how Coloured Petri Nets (CP-nets) can be extended to support synchronous communication. We introduce typed communication channels through which transitions are allowed to communicate. Small examples show how channel commnunication is convenient for creating compact and comprehensive models. The concepts introduced in this paper originate from the practical use of Petri nets for modelling, and they are formally defined in such a way that they preserve the basic properties of CP-nets. We show how a CP-net with channels can be transformed into a behaviourally equivalent CP-net. This allows us to deduce properties of CP-nets with channels from well-known properties of CP-nets.</p><p>As an example,we extend the concept of place invariants to cope with CP-nets with channels and show how place invariants can be found. This is done without transforming the CP-nets with channels into their equivalent CP-nets. CP-nets with channels can be used as a basis for new hierarchy constructs, and we outline an alternative to invocation transitions, based on CP-nets with channels. The reader is assumed to be familiar with the notion of CP-nets.</p>


Author(s):  
Yashwant Singh ◽  
Nanda Kulkarni

In the present paper, we study certain multidimensional fractional integral operators involving a general I-function in their kernel. We give five basic properties of these operators, and then establish two theorems and two corollaries, which are believed to be new. These basic theorems exhibit structural relationships between the multidimensional integral transforms. The one- and two-dimensional analogues of these results, which are new and of interest in themselves, can easily be deduced. Special cases of these latter theorems will give rise to certain known results obtained from time to time by several earlier authors.


Sign in / Sign up

Export Citation Format

Share Document