scholarly journals Petri Net Model Of Supply Vessel Consumption As Function Of The Nature Of The Business And The State Of The Wind And Sea

2021 ◽  
Vol 93 (7s) ◽  
pp. 73-85
Author(s):  
Toni Meštrović ◽  
◽  
Danko Kezić ◽  
Ivica Pavić ◽  
Srđan Vukša ◽  
...  
Keyword(s):  
Petri Nets ◽  
Fuel Consumption ◽  
Petri Net ◽  
Dynamic Process ◽  
Input Data ◽  
Oil Industry ◽  
The State ◽  
Discrete Events ◽  
Sea State ◽  
Approximate Cost

The state of prices and the development of a given economy depends largely on the gas and oil industry. Every day the gas and oil industry is growing and there is a growing need for platforms. In order for the platforms to pump gas and oil from the seabed unhindered, it is necessary to supply the platform which is done by supply vessels. In this paper, with the help of Petri nets and the tool “Yasper”, the dynamic process of supply and operation of supply vessels is simulated. Simulation is depending on the wind and wave conditions and the type of work that the supply vessel performs in cooperation with the platform. Input data are: Sea state, wind state, fuel consumption, type of vessel operation, distance from the mainland and the number of daily departures of the vessels from the port. The paper presents a model with discrete events in the process of supplying the platform, starting from the port and going out to sea until the work around the platform is completed and returning to the port. The report can provide information on the usability of the vessels and the approximate cost of the supply vessels on a voyage from port to the platform and back.

scholarly journals Dépliage des réseaux de Petri temporels à modèle sous-jacent non sauf

2011 ◽  
Vol Volume 14 - 2011 - Special... ◽  
Author(s):  
M. Sogbohossou ◽  
D. Delfieu
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
The State ◽  
Time Petri Nets ◽  
Real Time System ◽  
Time Petri Net ◽  
Finite Set ◽  
International Audience ◽  
Hard Real Time ◽  
Temporal Specifications

International audience For the formal verification of the concurrent or communicating dynamic systems modeled with Petri nets, the method of the unfolding is used to cope with the well-known problem of the state explosion. An extension of the method to the non safe time Petri nets is presented. The obtained unfolding is simply a prefix of that from the underlying ordinary Petri net to the time Petri net. For a certain class of time Petri nets, a finite prefix capturing the state space and the timed language ensues from the calculation of a finite set of finite processes with valid timings. The quantitative temporal constraints associated with these processes can serve to validate more effectively the temporal specifications of a hard real-time system. Pour la vérification formelle des systèmes dynamiques concurrents ou coopérants modélisés à l’aide des réseaux de Petri, la méthode du dépliage est utilisée pour endiguer le phénomène bien connu de l’explosion combinatoire. Une extension de la méthode aux réseaux de Petri temporels à modèle sous-jacent non sauf est présentée. Le dépliage obtenu est simplement un préfixe de celui du réseau de Petri ordinaire sous-jacent au réseau temporel. Pour une certaine classe de réseaux temporels, un préfixe fini capturant l’espace d’état et le langage temporisé découle du calcul d’un ensemble fini de processus finis réalisables. Les contraintes temporelles quantitatives associées à ces processus peuvent servir à valider plus efficacement les spécifications temporelles d’un système temps réel dur.

scholarly journals Unfolding through processes to compute the complete prefix of Petri nets

2017 ◽  
Vol Volume 27 - 2017 - Special... ◽  
Author(s):  
Médésu Sogbohossou ◽  
Antoine Vianou
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Partial Order ◽  
Petri Net ◽  
The State ◽  
Classical Approach ◽  
New Approach ◽  
State Space Explosion ◽  
Single Process ◽  
Partial Order Semantics

The partial-order technique of the unfolding implicitly represents state-space of a Petri net (PN), by in particular preserving the concurrency relations between the events. That makes it possible to contain state-space explosion problem in case of strong concurrency. A complete prefix of unfolding is used to cover all the state-space of a bounded PN: its computation according to the classical approach is based on the concept of adequate order, taking directly into account only safe PN. In this paper, a new approach independent of the concept of adequate order and faithful to the partial-order semantics, consists in creating the events of the unfolding in the context of a single process at the same time. The results of the tests are conclusive for safe and nonsafe PN. Some solutions are presented to improve compactness of the prefix obtained. La technique d'ordre partiel du dépliage représente implicitement l'espace d'état d'un réseau de Petri (RdP), en conservant notamment les relations de concurrence entre les événements. Cela permet de contenir le phénomène de l'explosion combinatoire en cas de forte concurrence. Un préfixe complet de dépliage sert à couvrir tout l'espace d'état d'un RdP borné: son calcul suivant l'approche classique se base sur le concept d'ordre adéquat, ne prenant directement en compte que les RdP saufs. Dans cet article, une nouvelle approche indépendante du concept d'ordre adéquat et fidèle à la sémantique d'ordre partiel, consiste à créer les événements du dépliage dans le contexte d'un unique processus à la fois. Les résultats des tests sont concluants pour les RdP saufs et non saufs. Des solutions sont présentées pour améliorer la compacité du préfixe obtenu.

A CONSTRUCTIVE METHOD FOR FINDING LEGAL TRANSITION SEQUENCES IN PETRI NETS

1998 ◽  
Vol 08 (01) ◽  
pp. 189-222 ◽  
Author(s):  
JENG S. HUANG ◽  
TADAO MURATA
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Nonnegative Integer ◽  
State Equation ◽  
The State ◽  
Constructive Method ◽  
Reachability Problem ◽  
Search Effort ◽  
Representation Systems ◽  
Integer Solutions

This paper considers the Petri net reachability problem formulated in terms of nonnegative integer solutions of the state equation and their net representation systems. Our main contributions are twofold. First, we show that algorithms for finding legal transition sequences can be easily given for subclasses of Petri nets where reachability criteria are known or can be formulated by our method. Second, for the general reachability problem where reachability theorems or criteria are not known, and thus an exhaustive search for legal transition sequences is inevitable, we introduce the notion of non-crucial sequences to reduce the search effort.

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.

An Axiomatic Characterization of a Class of Petri Nets

1991 ◽  
Vol 14 (4) ◽  
pp. 477-491
Author(s):  
Waldemar Korczynski
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Axiomatic Characterization ◽  
Algebraic Characterization

In this paper an algebraic characterization of a class of Petri nets is given. The nets are characterized by a kind of algebras, which can be considered as a generalization of the concept of the case graph of a (marked) Petri net.

The Quantitative Assessment of Domino Effects Based on Stochastic Petri Nets

2008 ◽  
Vol 44-46 ◽  
pp. 537-544
Author(s):  
Shi Yi Bao ◽  
Jian Xin Zhu ◽  
Li J. Wang ◽  
Ning Jiang ◽  
Zeng Liang Gao
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Petri Net ◽  
Quantitative Assessment ◽  
Stochastic Petri Nets ◽  
Industrial Park ◽  
Domino Effect ◽  
State Space Explosion ◽  
Stochastic Petri Net ◽  
Chemical Industrial Park

The quantitative analysis of “domino” effects is one of the main aspects of hazard assessment in chemical industrial park. This paper demonstrates the application of heterogeneous stochastic Petri net modeling techniques to the quantitative assessment of the probabilities of domino effects of major accidents in chemical industrial park. First, five events are included in the domino effect models of major accidents: pool fire, explosion, boiling liquid expanding vapour explosion (BLEVE) giving rise to a fragment, jet fire and delayed explosion of a vapour cloud. Then, the domino effect models are converted into Generalized Stochastic Petri net (GSPN) in which the probability of the domino effect is calculated automatically. The Stochastic Petri nets’ models, which are state-space based ones, increase the modeling flexibility but create the state-space explosion problems. Finally, in order to alleviate the state-space explosion problems of GSPN models, this paper employs Stochastic Wellformed Net (SWN), a particular class of High-Level (colored) SPN. To conduct a case study on a chemical industrial park, the probability of domino effects of major accidents is calculated by using the GSPN model and SWN model in this paper.

Structural Property Analysis of a Kind of Petri Net Synthesis

2011 ◽  
Vol 255-260 ◽  
pp. 1989-1993
Author(s):  
Chuan Liang Xia ◽  
Zhen Dong Liu ◽  
Peng Sun
Keyword(s):  
Structural Properties ◽  
Structural Property ◽  
Petri Net ◽  
The State ◽  
Property Analysis ◽  
Petri Net Synthesis

Petri net synthesis can avoid the state exploration problem by guaranteeing the correctness in the Petri net while incrementally expanding the net. This paper proposes the conditions imposed on a synthesis shared a kind of subnet under which the following structural properties will be preserved: repetitiveness, consistency, structural boundedness, conservativeness, structural liveness, P-invariant and T-invariant.

THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT

1998 ◽  
Vol 08 (01) ◽  
pp. 21-66 ◽  
Author(s):  
W. M. P. VAN DER AALST
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Business Processes ◽  
State Of The Art ◽  
Workflow Management ◽  
Explicit Representation ◽  
The Other ◽  
Application Domain ◽  
Analysis Techniques ◽  
The One

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.

Hierarchical Configurable Petri Net Modeling in VHDL

2012 ◽  
Vol 58 (4) ◽  
pp. 397-402 ◽  
Author(s):  
Michał Doligalski ◽  
Marian Adamski
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Control Process ◽  
Discrete Control ◽  
Dual Model ◽  
Description Language ◽  
Direct Support ◽  
Hardware Description ◽  
Logical Synthesis ◽  
State Machine Diagram

Abstract The paper presents method for hierarchical configurable Petri nets description in VHDL language. Dual model is an alternative way for behavioral description of the discrete control process. Dual model consists of two correlated models: UML state machine diagram and hierarchical configurable Petri net (HCfgPN). HCfgPN are Petri nets variant with direct support of exceptions handling mechanism. Logical synthesis of dual model is realized by the description of HCfgPN model by means of hardware description language. The paper presents placesoriented method for HCfgPN description in VHDL language

Sign in / Sign up

Export Citation Format

Share Document