Results 271 to 280 of about 27,619 (295)
Some of the next articles are maybe not open access.

Possibilistic Petri nets

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

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.
Jean-Pierre Courtiat   +1 more
openaire   +2 more sources

Petri Nets with Time

2013
In previous chapters, Place/Transition nets have been used to model Discrete Event Systems with the aim of analyzing logical properties. However, such a model is not suitable for performance analysis because it does not keep into account the duration of the activities occurring in a system.
Bérard B   +4 more
openaire   +3 more sources

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.
BERNARDI, Simona   +2 more
openaire   +4 more sources

Petri Net Distributability

2012
A Petri net is distributed if, given an allocation of transitions to (geographical) locations, no two transitions at different locations share a common input place. A system is distributable if there is some distributed Petri net implementing it.
Darondeau, Philippe, Best, Eike
openaire   +2 more sources

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

Petri Net Transformations in the ≫Petri Net Baukasten≪

2003
The 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.
Milan Urbásek   +2 more
openaire   +2 more sources

Coloured Petri Nets

1987
This paper describes a Petri net model, called Coloured Petri nets (CP-nets), where information is attached to each token. The information can be inspected and modified when a transition fires. For most applications, this generalization of ordinary Petri nets allows the user to make more manageable descriptions, due to the fact that equal subnets can ...
openaire   +2 more sources

Petri Nets

2009
No abstract.
openaire   +1 more source

Introduction to Petri Nets

2013
Petri nets are one of the most important discrete event systems formalisms. Three are the main reasons of this. Firstly, they provide a rich family of both logic and timed models, that share a set of formal tools. Secondly, they can be used in all phases of design of a control system.
Cabasino MP   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy