نتایج جستجو برای: weighted fuzzy petri net wfpn

تعداد نتایج: 287999  

2008
Eduardo Correia Paulo Claudino Véras Osamu Saotome Emilia Villani Eduardo Gomes

This paper approaches the process of validating and verifying the embedded control system of a satellite prototype. The focus of this approach is on the integration of UML and Petri nets, aiming at the formal verification of the system requirements. The approach is composed of: (1) simulation of the UML model in a CASE tool; (2) simulation of the Petri net model in a Petri net simulator; and (3...

Journal: :Knowl.-Based Syst. 2006
Dragan Gasevic Vladan Devedzic

The paper presents the Petri net ontology that enables sharing Petri nets on the Semantic Web. Previous work on formal methods for representing Petri nets mainly defines tool-specific descriptions or formats for model interchange. However, such efforts do not provide a suitable description for using Petri nets on the Semantic Web. This paper uses the Petri net UML model as a starting point for ...

Journal: :Int. J. Fuzzy Logic and Intelligent Systems 2013
Qian Gao Young-Im Cho

Petri Nets are a system description and analysis tool. Reachability is one of the most basic properties in Petri Net research. In a sense, reachability research is the foundation study for other dynamic properties of Petri Nets through which many problems involving Petri Nets can be described. Nowadays, there are two mature analysis methods–the matrix equation and the reachability tree. However...

2011
Chen-xi SHAO Zhen-zhong SHAO Xue-feng WU

Message Sequence Chart (MSC) is a graphical trace language for describing the communication behaviour of distributed systems. In order to build a Petri Net model of a complex system, this paper introduces a strategy to build a Petri Net model by using MSC. The algorithm of translating the MSC model to Petri Net model is also given in this paper. We can get the Petri Net model and improve it by ...

2012
Jaegeol Yim Jaehun Joo Gyeyoung Lee

This paper presents a Petri net based analysis of ontology for indoor location-based services. The proposed method builds up a Petri net model for the given ontology at the first step. Then, it analyzes the Petri net model by running the simulation on it. The proposed method of building a Petri net model for the given ontology is given in the paper. Then algorithms of performing inferences on t...

2009
C. Renato Vázquez Manuel Silva

A Markovian Petri net is a stochastic discrete event system frequently used for analysis and performance evaluation purposes. In the past, the fluidification has been proposed as a relaxation technique for avoiding the ”state explosion problem”. Following the same approach, in this paper a hybrid Petri net model is defined as a partial relaxation of an original Markovian Petri net. It is shown ...

2015
Kamila Barylska Eike Best Evgeny Erofeev Lukasz Mikulski Marcin Piatkowski

A finite word is called Petri net solvable if it is isomorphic to the reachability graph of some unlabelled Petri net. In this paper, the class of two-letter Petri net solvable words is studied.

1999
James Peters Andrzej Skowron Zbigniew Suraj Sheela Ramanna

This paper considers the construction of Petri nets to simulate the computation performed by decision systems. Algorithms are given to construct Petri nets which correspond to decision rules, information systems, and real-time decision systems. Rough as well as roughly fuzzy Petri net extensions of coloured Petri net are used to create highly parallel programs to simulate reasoning system compu...

2004
M. Uzam Jones N. Ajlouni

W u d As automated manufacturing systems become more complex, the need for an effective design tool to p d u c e both high level Discrete Event Control System (DECS) and low level implementation, becomes increasingly more important Petri nets represent the most effective method for both the design and implementation of DECSs. The conversion of such Petri nets into ml-time applications has mnt l...

2013
Gajendra Pratap Singh Sangita Kansal Mukti Acharya

In the continuing research towards characterizing 1-safe Petri nets with n-places and generating all the 2n binary n-vectors as marking vectors exactly once, the problem of determine minimum Petri nets; 'minimum' in the sense that the number of transitions is kept minimum possible for the generation of all the 2n binary n-vectors has been found. In this paper, the existence and unique...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید