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>

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 Computer Aided Verification of Lamport's Fast Mutual Exclusion Algorithm - Using Coloured Petri Nets and Occurrence Graphs with Symmetries

1997 ◽  
Vol 26 (512) ◽  
Author(s):  
Jens Bæk Jørgensen ◽  
Lars Michael Kristensen
Keyword(s):  
Distributed Systems ◽  
Petri Nets ◽  
Mutual Exclusion ◽  
Condensed State ◽  
Coloured Petri Nets ◽  
Computer Tool ◽  
State Spaces ◽  
Index Terms ◽  
High Level ◽  
Mutual Exclusion Algorithm

<p>In this paper, we present a new computer tool for verification of distributed systems. As an example, we establish the correctness of Lamport's Fast Mutual Exclusion Algorithm. The tool implements the method of occurrence graphs with symmetries (OS-graphs) for Coloured Petri Nets(CP-nets). The basic idea in the approach is to exploit the symmetries inherent in many distributed systems to construct a condensed state space. We demonstrate a signigicant increase in the number of states which can be analysed. The paper is to a large extent self-contained and does not assume any prior knowledge of CP-nets (or any other kinds of Petri Nets) or OS-graphs. CP-nets and OS-graphs are not our invention. Our contribution is development of the tool and verification of the example.</p><p><strong>Index Terms:</strong> Modelling and Analysis of Distributed Systems, Formal Verification, Coloured Petri Nets, High-Level Petri Nets, Occurrence Graphs, State Spaces, Symmetries, Mutual Exclusion.</p>

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.

scholarly journals XML format for notation of object-oriented Petri net

2007 ◽  
Vol 55 (3) ◽  
pp. 47-56 ◽  
Author(s):  
Petr Jedlička
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Object Oriented ◽  
Markup Language ◽  
Verification Of Models ◽  
Petri Net Markup Language ◽  
Interchange Format ◽  
High Level ◽  
Object Petri Net ◽  
Object Oriented Systems

Petri nets provide executive facilities for simulation of causality, non-determinism and parallelism in discreet systems. Since they are a mathematical model in substance, they offer theory, which can be successfully used to verification of models. Executability of Petri nets predestinates them for simulation and fast prototyping. Object Petri nets represent rather complicated class, based on hierarchical and high-level Petri nets. However their complexity is balanced by their ability to identify significant characteristics of system model and to visualize it in a graphic representation.Tools currently applied to modeling, simulation and verification of various Petri net variants use language PNML (Petri Net Markup Language) as an interchange format. However PNML is not capable of expression of object Petri net. This paper introduces prototype of XML-based language for modeling of parallel object-oriented systems described by object Petri net. This language, based on PNML, was named OPNML (Object Petri Net Markup Language).

Exploiting symmetries of high-level Petri games in distributed synthesis

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Nick Würdemann
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Distributed System ◽  
Petri Net ◽  
Space Reduction ◽  
Ongoing Work ◽  
Player Game ◽  
High Level ◽  
State Space Reduction

Abstract Distributed Synthesis is the problem of automatically generating correct controllers for individual agents in a distributed system. Petri games model this problem by a game between two teams of players on a Petri net structure. Under some restrictions, Petri games can be solved by a reduction to a two player game. The concept of symmetries in Petri nets is closely related to high-level representations of Petri games. Applying symmetries to the states in the two-player game results in a significant state space reduction. We give an overview about (high-level) Petri games and the application of symmetries in this setting. We present ongoing work aiming to concisely describe solutions of Petri games by a high-level representation.

scholarly journals Coloured Petri Nets: A High Level Language for System Design and Analysis

1993 ◽  
Vol 19 (338) ◽  
Author(s):  
Kurt Jensen
Keyword(s):  
Petri Nets ◽  
Software Systems ◽  
Coloured Petri Nets ◽  
Human Beings ◽  
High Level Language ◽  
Design Specification ◽  
Computer Tools ◽  
Simulation Validation ◽  
Definition Of ◽  
High Level

This paper describes how Coloured Petri Nets (CP-nets) have been developed - from being a promising theoretical model to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems (and other systems in which human beings and/or computers communicate by means of some more or less formal rules). First CP-nets are introduced by means of a small example and a formal definition of their structure and behaviour is presented. Then we describe how to extend CP-nets by a set of hierarchy constructs (allowing a hierarchical CP-net to consist of many different subnets, which are related to each other in a formal way). Next we describe how to analyse CP-nets, how to support them by various computer tools, and we also describe some typical applications. Finally, a number of future extensions are discussed (of the net model and the supporting software).

scholarly journals Algorithm to Convert Signal Interpreted Petri Net Models to Programmable Logic Controller Ladder Logic Diagram Models

2018 ◽  
Vol 10 (3) ◽  
pp. 905
Author(s):  
Z. Aspar ◽  
Nasir Shaikh-Husin ◽  
M. Khalil-Hani
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Programmable Logic Controller ◽  
Conversion Process ◽  
Programmable Logic ◽  
Logic Diagram ◽  
Speed Up ◽  
High Level ◽  
Ladder Logic ◽  
Matrix Calculation

<span>Signal Interpreted Petri Nets (SIPN) modeling has been proposed as an alternative to Ladder Logic Diagram (LLD) modeling for programming complex programmable logic controllers (PLCs) due to its high level of abstraction and functionalities. This paper proposes an algorithm to efficiently convert existing SIPN models to their LLD models equivalences. In order to automate and speed up the conversion process, matrix calculation approach is used. A complex SIPN model was used to show that existing conversion technique must be expanded in order to cater for a more complex SIPN models.</span>

Sign in / Sign up

Export Citation Format

Share Document