Characterization of timed well-formed Petri nets behavior by means of occurrence equations

2002 ◽  
Author(s):  
G. Chiola
Keyword(s):  
Petri Nets

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.

Algebraic properties of processes for Local Action Systems

2002 ◽  
Vol 12 (4) ◽  
pp. 423-448
Author(s):  
NICO VERLINDEN ◽  
DIRK JANSSENS
Keyword(s):  
Petri Nets ◽  
Formal Semantics ◽  
Dynamic Structure ◽  
Concurrent Systems ◽  
Local Action ◽  
Graph Rewriting ◽  
Action Systems ◽  
Algebraic Properties ◽  
Dynamic Structures

Graph rewriting has been used extensively to model the behaviour of concurrent systems and to provide a formal semantics for them. In this paper, we investigate processes for Local Action Systems (LAS); LAS generalize several types of graph rewriting based on node replacement and embedding. An important difference between processes for Local Action Systems and the process notions that have been introduced for other systems, for example, Petri nets, is the presence of a component describing the embedding mechanism. The aim of the paper is to develop a methodology for dealing with this embedding mechanism: we introduce a suitable representation (a dynamic structure) for it, and then investigate the algebraic properties of this representation. This leads to a simple characterization of the configurations of a process and to a number of equational laws for dynamic structures. We illustrate the use of these laws by providing an equational proof of one of the basic results for LAS processes, namely that the construction yielding the result graph of a process behaves well with respect to the sequential composition of processes.

Characterization of Admissible Marking Sets in Petri Nets with Uncontrollable Transitions

2016 ◽  
Vol 61 (7) ◽  
pp. 1953-1958 ◽  
Author(s):  
Shouguang Wang ◽  
Dan You ◽  
MengChu Zhou ◽  
Carla Seatzu
Keyword(s):  
Petri Nets

scholarly journals Sistema para detección y aislamiento de fallas utilizando Redes de Petri Interpretadas (RPI)

2019 ◽  
pp. 1-5
Author(s):  
Veronica Hernandez ◽  
Alejandro Arredondo ◽  
Elvia Ruiz
Keyword(s):  
Petri Nets ◽  
Discrete Event ◽  
Failure Detection ◽  
Area Of Influence ◽  
And Control ◽  
Failure Monitoring ◽  
The Given ◽  
Implementation In Matlab ◽  
Control Failures

Interpreted Petri Nets (IPN) allow the analysis of Discrete Event Systems (DES) to guarantee the detection of failures in a fast, efficient, and safe way. The objective of this research is the design of an Interpreted Petri Net for the detection of failures in a water supply system. The IPN allows us to identify two types of failures, permanent failures and control failures. The first are inherent to the system and are those that make impossible the functionality of the system. The second refers to those that are inherent to the user and are those failures that do not meet the given specifications. Detecting failures in a system allows the improvement of the operation in such a way that it is more efficient. In this manner, it is possible to design reliable systems which can work properly. In this research, an algorithm was designed for the sensors involved in the system using Interpreted Petri Nets. The detection of failures as main objective is achieved through the implementation of a previously designed IPN. By implementing a programming code in MATLAB®, it was possible to observe its simulated behavior in the system. The input parameters used assume a behavior. Objective: Analyze and implement a mathematical model to automatically detect failures in a system, based on a polynomial algorithm according to the methodology proposed in Matlab®. Methodology: Algorithms were used to characterize the area of influence of the failure in the IPN of the system, from which the implementation in Matlab® showed minimal T-semiflows that do not share any transition with the structure where the failure is located. Therefore, if the problem of linear programming has a solution then the system will be not diagnosable. In this case, if the system is modeled by parts, it is possible to find those parts that are diagnosable and therefore implement the methodology, in this way a module model will be obtained in which the failure detection can be performed. Contribution: Characterization of the diagnosticability property and use of algorithms in MATLAB® to analyze the property of systems designed by IPN. Identify failure occurrence modeled in a system using IPN in MATLAB® for failure monitoring.

Fault Detection, Isolation and Characterisation for Discrete Event Systems Based on Petri Nets Models

2010 ◽  
pp. 387-416
Author(s):  
Dimitri Lefebvre ◽  
Edouard Leclercq ◽  
Souleiman Ould El Mehdi
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
Practical Interest ◽  
Transportation Systems ◽  
Intermittent Faults ◽  
Event Systems ◽  
Stochastic Time

Petri net models are used to detect and isolate faults in case of discrete event systems as manufacturing, robotic, communication and transportation systems. This chapter addresses two problems. The first one is the structure designs and parameters identification of the Petri net models according to the observation and analysis of the sequences of events that are collected. Deterministic and stochastic time Petri nets are concerned. The proposed method is based on a statistical analysis of data and has a practical interest as long as sequences of events are already saved by supervision systems. The second problem concerns the use of the resulting Petri net models to detect, isolate and characterize faults in discrete event systems. This contribution includes the characterization of intermittent faults. This issue is important because faults are often progressive from intermittent to definitive and early faults detection and isolation improve productivity and save money and resources.

Liveness, Deadlock-Freeness, and Siphons

2013 ◽  
pp. 65-78
Author(s):  
Kamel Barkaoui
Keyword(s):  
Petri Nets ◽  
Structure Theory ◽  
Liveness Properties

This chapter deals with the structure theory of Petri nets. The authors define the class of P/T systems, namely K-systems, for which the equivalence between controlled-siphon, deadlock-freeness, and liveness properties holds. Using the new structural notions of ordered transitions and root places, they revisit the non-liveness characterization of P/T systems satisfying the cs-property and define by syntactical manner new and more expressive subclasses of K-systems where the interplay between conflict and synchronization is relaxed.

scholarly journals Characterization of Admissible Marking Sets in Petri Nets With Conflicts and Synchronizations

2017 ◽  
Vol 62 (3) ◽  
pp. 1329-1341 ◽  
Author(s):  
Ziyue Ma ◽  
Zhiwu Li ◽  
Alessandro Giua
Keyword(s):  
Petri Nets
Sign in / Sign up

Export Citation Format

Share Document