scholarly journals FIRE FIGHTING SYSTEM MODELING IN OIL AND GAS WATERWAY TERMINAL BASED ON COLORED PETRI NETS

Author(s):  
LUIZ H. C. VALDA ◽  
JANDECY CABRAL LEITE ◽  
RIVANILDO D. ALMEIDA ◽  
JOÃO P. A. OLIVEIRA
Author(s):  
G. Petrosyan ◽  
L. Ter-Vardanyan ◽  
A. Gaboutchian

Biometric identification systems use given parameters and function on the basis of Colored Petri Nets as a modelling language developed for systems in which communication, synchronization and distributed resources play an important role. Colored Petri Nets combine the strengths of Classical Petri Nets with the power of a high-level programming language. Coloured Petri Nets have both, formal intuitive and graphical presentations. Graphical CPN model consists of a set of interacting modules which include a network of places, transitions and arcs. Mathematical representation has a well-defined syntax and semantics, as well as defines system behavioural properties. One of the best known features used in biometric is the human finger print pattern. During the last decade other human features have become of interest, such as iris-based or face recognition. The objective of this paper is to introduce the fundamental concepts of Petri Nets in relation to tooth shape analysis. Biometric identification systems functioning has two phases: data enrollment phase and identification phase. During the data enrollment phase images of teeth are added to database. This record contains enrollment data as a noisy version of the biometrical data corresponding to the individual. During the identification phase an unknown individual is observed again and is compared to the enrollment data in the database and then system estimates the individual. The purpose of modeling biometric identification system by means of Petri Nets is to reveal the following aspects of the functioning model: the efficiency of the model, behavior of the model, mistakes and accidents in the model, feasibility of the model simplification or substitution of its separate components for more effective components without interfering system functioning. The results of biometric identification system modeling and evaluating are presented and discussed.


2014 ◽  
Vol 35 (11) ◽  
pp. 2608-2614
Author(s):  
Xiang Gao ◽  
Yue-fei Zhu ◽  
Sheng-li Liu

Author(s):  
Goharik Petrosyan ◽  
Armen Gaboutchian ◽  
Vladimir Knyaz

Petri nets are a mathematical apparatus for modelling dynamic discrete systems. Their feature is the ability to display parallelism, asynchrony and hierarchy. First was described by Karl Petri in 1962 [1,2,8]. The Petri net is a bipartite oriented graph consisting of two types of vertices - positions and transitions connected by arcs between each other; vertices of the same type cannot be directly connected. Positions can be placed by tags (markers) that can move around the network. [2] Petri Nets (PN) used for modelling real systems is sometimes referred to as Condition/Events nets. Places identify the conditions of the parts of the system (working, idling, queuing, and failing), and transitions describe the passage from one state to another (end of a task, failure, repair...). An event occurs (a transition fire) when all the conditions are satisfied (input places are marked) and give concession to the event. The occurrence of the event entirely or partially modifies the status of the conditions (marking). The number of tokens in a place can be used to identify the number of resources lying in the condition denoted by that place [1,2,8]. Coloured Petri nets (CPN) is a graphical oriented language for design, specification, simulation and verification of systems [3-6,9,15]. It is in particular well-suited for systems that consist of several processes which communicate and synchronize. Typical examples of application areas are communication protocols, distributed systems, automated production systems, workflow analysis and VLSI chips. In the Classical Petri Net, tokens do not differ; we can say that they are colourless. Unlike standard Petri nets in Colored Petri Net of a position can contain tokens of arbitrary complexity, such as lists, etc., that enables modelling to be more reliable. The article is devoted to the study of the possibilities of modelling Colored Petri nets. The article discusses the interrelation of languages of the Colored Petri nets and traditional formal languages. The Venn diagram, which the author has modified, shows the relationship between the languages of the Colored Petri nets and some traditional languages. The language class of the Colored Petri nets includes a whole class of Context-free languages and some other classes. The paper shows modelling the task synchronization Patil using Colored Petri net, which can't be modeled using well- known operations P and V or by classical Petri network, since the operations P and V and classical Petri networks have limited mathematical properties which do not allow to model the mechanisms in which the process should be synchronized with the optimal allocation of resources.


Sign in / Sign up

Export Citation Format

Share Document