Results 241 to 250 of about 1,107,230 (292)
Some of the next articles are maybe not open access.
Petri Net Transformations in the ≫Petri Net Baukasten≪
2003The purpose of this contribution is to give an overview of constructions and results for Petri net transformations in the ≫Petri Net Baukasten≪ developed by the “DFG-Forschergruppe Petrinetz-Technologie”. The two main concepts of Petri net transformations considered in this context are net class and net model transformations.
Benjamin Braatz +2 more
openaire +2 more sources
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 1999
This paper presents the possibilistic Petri net model which combines possibility logic with Petri nets with objects. The main feature of this model is to allow one to reason about the aspects of uncertainty and change in dynamic discrete event systems.
Cardoso, Janette +2 more
openaire +5 more sources
This paper presents the possibilistic Petri net model which combines possibility logic with Petri nets with objects. The main feature of this model is to allow one to reason about the aspects of uncertainty and change in dynamic discrete event systems.
Cardoso, Janette +2 more
openaire +5 more sources
2004
Dependability evaluation main objective is to assess the ability of a system to correctly function over time. There are many possible approaches to the evaluation of dependability: in these notes we are mainly concerned with dependability evaluation based on probabilistic models.
BERNARDI, Simona +2 more
openaire +4 more sources
Dependability evaluation main objective is to assess the ability of a system to correctly function over time. There are many possible approaches to the evaluation of dependability: in these notes we are mainly concerned with dependability evaluation based on probabilistic models.
BERNARDI, Simona +2 more
openaire +4 more sources
2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), 2005
Diagnosability of discrete event systems (DES) was formally defined in finite state machine (FSM) models by Sampath, et al. They gave a method for testing diagnosability by first constructing a diagnoser for the system. The complexity of this method is exponential in the number of states and doubly exponential in the number of failure types. Later, Yoo,
YuanLin Wen, MuDer Jeng
openaire +1 more source
Diagnosability of discrete event systems (DES) was formally defined in finite state machine (FSM) models by Sampath, et al. They gave a method for testing diagnosability by first constructing a diagnoser for the system. The complexity of this method is exponential in the number of states and doubly exponential in the number of failure types. Later, Yoo,
YuanLin Wen, MuDer Jeng
openaire +1 more source
Proceedings of 1st International Conference on Conventional and Knowledge Based Intelligent Electronic Systems. KES '97, 2002
Proposes a new model of a fuzzy Petri net and an algorithm to generate such a network automatically. As an example of the application of the fuzzy Petri net, it is used to classify the Iris data set. Although there are extensive examples of neural network-based classifiers in the literature, they all share the undesirable characteristic of a long ...
P. Cheng, K. Forward
openaire +2 more sources
Proposes a new model of a fuzzy Petri net and an algorithm to generate such a network automatically. As an example of the application of the fuzzy Petri net, it is used to classify the Iris data set. Although there are extensive examples of neural network-based classifiers in the literature, they all share the undesirable characteristic of a long ...
P. Cheng, K. Forward
openaire +2 more sources
2008
In a seminal paper Montanari and Meseguer showed that an algebraic interpretation of Petri nets in terms of commutative monoids can be used to provide an elegant characterisation of the deterministic computations of a net, accounting for their sequential and parallel composition.
Baldan, Paolo, GADDUCCI, FABIO
openaire +4 more sources
In a seminal paper Montanari and Meseguer showed that an algebraic interpretation of Petri nets in terms of commutative monoids can be used to provide an elegant characterisation of the deterministic computations of a net, accounting for their sequential and parallel composition.
Baldan, Paolo, GADDUCCI, FABIO
openaire +4 more sources
The dimensions of Petri nets: The Petri net cube
Bull. EATCS, 1998Summary: There exist many different Petri net formalisms. In this paper, we present the Petri net cube which helps to structure and classify the variety of Petri net formalisms. We show, that three basic aspects are sufficient for describing most classical Petri net formalisms.
Ekkart Kindler, Michael Weber 0003
openaire +2 more sources
Using Petri nets as a model for Petri nets
Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems, 2003This paper deals with the study of behavioral equivalences between labeled (place/transition) Petri nets preserving the causal relationship among transition firings. This is achieved by defining a very slight modification in the conventional Petri net formalism, leading to associating an additional information to each token of the net.
R.J. Coelho da Costa, J.-P. Courtiat
openaire +1 more source