A new class of a high-level Petri net for modelling logical OR efficiently: Coloured AND/OR Petri nets (CARPN)

2000 ◽  
Vol 38 (18) ◽  
pp. 4671-4682 ◽  
Author(s):  
Latif Salum
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
New Class ◽  
High Level

Extremely Fast Heuristic Event-Driven Job Shop Scheduler With a New Class of Extended Petri Nets

2021 ◽  
pp. 512-539
Author(s):  
Alexander Kostin
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Dynamic Models ◽  
Job Shop ◽  
Scheduling System ◽  
New Class ◽  
Extended Petri Nets ◽  
Close Cooperation ◽  
Single Processor ◽  
Unique Mechanism

A very fast scheduling system is proposed and experimentally investigated. The system consists of a job shop manager and dynamic models of machines. A schedule is created in the course of a close cooperation with models of the machines that generate driving events for the scheduler. The system is implemented with a new class of extended Petri nets and runs in the environment of the Petri-net tool WINSIM. The scheduler creates a schedule sequentially, without any form of enumerative search. To investigate the scheduler performance, a large number of experiments were conducted with the use of few strategies. Due to a unique mechanism of monitoring of triggering events in the Petri net, the developed scheduler runs at least hundreds of times faster than any known single-processor job shop scheduler.

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