Results 221 to 230 of about 20,891 (263)
Some of the next articles are maybe not open access.

Petri Nets Are Dioids

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   +3 more sources

Diagnosability of Petri nets

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

Fuzzy Petri nets

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   +1 more source

Petri Nets and Dependability

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.
S. BERNARDI   +2 more
openaire   +3 more sources

The dimensions of Petri nets: The Petri net cube

Bull. EATCS, 1998
Summary: 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   +1 more source

Petri Nets with Time Windows: A Comparison to Classical Petri Nets

Fundamenta Informaticae, 2009
We present Petri nets with time windows (tw-PN) where each place is associated with an interval (window). Every token which arrives at a place gets a real-valued clock which shows its "age". A transition can fire when all needed tokens are "old enough".
Jan-Thierry Wegener   +1 more
openaire   +2 more sources

Improving the Usability of Petri Nets with the ≫Petri Net Baukasten≪

2001
An enormously rich variety of Petri net concepts, techniques, and methods as well as various tools and tool environments has been developed to support the process-driven system development. But, system development under the use of Petri nets is still difficult since the one which best fits the application cannot be identified easily.
Herbert Weber   +2 more
openaire   +1 more source

Petri Nets

2009
No abstract.
openaire   +1 more source

Using Petri nets as a model for Petri nets

Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems, 2003
This 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

Recursive Petri nets

Acta Informatica, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haddad, Serge, Poitrenaud, Denis
openaire   +2 more sources

Home - About - Disclaimer - Privacy