scholarly journals MANAGEMENT OF DESIGN ITERATIONS ON COUPLED PARAMETERS IN DESIGN TEAMWORK USING MULTIPLE DOMAIN MATRIX AND COLOURED PETRI NETS

2020 ◽  
Vol 1 ◽  
pp. 617-626
Author(s):  
J. Juranić ◽  
N. Pavković ◽  
D. Jurinić
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Design Parameter ◽  
Coloured Petri Nets ◽  
Design Team ◽  
Novel Approach ◽  
Coloured Petri Net ◽  
Degree Of Coupling ◽  
Parameter Relations ◽  
Multiple Domain

AbstractA new way of structuring and interpretation of multiple domain matrix is proposed as the basis for categorisation of design parameter relations complexity. Depending on the kind and the degree of coupling of the parameters, the developed methodology activates the appropriate coloured Petri net (CPN) models for semi-automatic support of communication between the members of the design team. The proposed extension of MDM combined with CPN is a novel approach to predicting and managing communication patterns necessary during teamwork coordination on critical interfaces between product components.

Teaching Principles of Petri Nets in Hardware Courses and Students Projects

2010 ◽  
pp. 178-190 ◽  
Author(s):  
Hana Kubátová
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Hardware Implementation ◽  
Hardware Design ◽  
Coloured Petri Nets ◽  
Modeling Tool ◽  
Teaching Principles ◽  
Group Projects ◽  
Simulation Results ◽  
Hardware Specification

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.

scholarly journals An Introduction to High-Level Petri Nets

1985 ◽  
Vol 14 (197) ◽  
Author(s):  
Kurt Jensen
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Coloured Petri Nets ◽  
High Level

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

scholarly journals Symmetric Cryptosystem Based on Petri Net

2017 ◽  
Vol 26 (1) ◽  
pp. 1-8
Author(s):  
Hussein ‎ A. Lafta ◽  
Rand Abdul-Wahid M. Ali
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Private Key ◽  
Cipher Text ◽  
Look Up Table ◽  
Novel Approach ◽  
Encryption Decryption

In this wok, a novel approach based on ordinary Petri net is used to generate private key . The reachability marking  of petri net is used as encryption/decryption key to provide more complex key . The same ordinary Petri Nets models  are used for the sender(encryption) and  the receiver(decryption).The plaintext has been permutated  using  look-up table ,and XOR-ed with key to generate cipher text

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
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
The Other ◽  
Coloured Petri Nets ◽  
Basic Properties ◽  
New Concepts ◽  
Special Cases ◽  
The One ◽  
Net Framework ◽  
Informal Description

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.

scholarly journals Modeling by Petri Nets

10.14311/676 ◽  
2005 ◽  
Vol 45 (2) ◽  
Author(s):  
H. Kubátová
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Specific Model ◽  
Digital System ◽  
Black And White ◽  
Railway Tracks ◽  
Formal Definitions ◽  
Different Types ◽  
Coloured Petri Net ◽  
Dining Philosophers

One specific model of a digital system in different types of Petri nets is presented. The formal definitions of the basic (black-and-white) Petri net, a place/transition net (P/T net), an arc-constant coloured Petri net (ac-CPN) and a coloured Petri net (CPN) are presented and explained on the basis of this example. Real models of dining philosophers, a producer-consumer system and railway tracks are described.

Constrained Petri Nets. Part II: Generalizations and extensions

1983 ◽  
Vol 6 (3-4) ◽  
pp. 333-374
Author(s):  
H.J.M. Goeman ◽  
L.P.J. Groenewegen ◽  
H.C.M. Kleijn ◽  
G. Rozenberg
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Theoretical Framework ◽  
General Constraints ◽  
Context Free ◽  
Boolean Expressions

This paper continues the investigation froll1 [Goeman et al.] concerning the use of sets of places of a Petri net as additional (to input places) constraints for granting concession. Now interpretations of more general constraints are considered and expressed as Boolean expressions. This gives rise to various classes of constrained Petri nets. These are compared in the language theoretical framework introduced in [Goeman et al.]. An upperbound for the language defining power is found in the class of context-free programmed languages.

Sign in / Sign up

Export Citation Format

Share Document