Results 261 to 270 of about 1,107,230 (292)
Some of the next articles are maybe not open access.

Petri’s Understanding of Nets

2019
The author offers a personal account of how Carl Adam Petri explained nets, tokens, and dynamics in the universe.
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   +2 more sources

Time and Petri Nets

2013
At first glance the concepts of time and of Petri nets are quite contrary: while time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and they represent events as concurrent systems. But if we take a closer look at how time and causality are intertwined we realize that there are many possible ...
openaire   +1 more source

Petri Nets

ACM Computing Surveys, 1977
openaire   +2 more sources

Generalizations of Petri nets

1981
In this paper we give an overview of some formal models of concurrent systems, that are derived from the classical Petri net model. Since several of these models are introduced by Petri and his group within General Net Theory [4] they can also be called 'high-level Petri nets'.
openaire   +1 more source

Petri net games

J. Inf. Process. Cybern., 1983
A generalized nim game is defined for which a Petri net is used like a chessboard. In a Petri net game two players successively block transitions from exactly one set of transitions in the net. The first one who has no transition to block is the looser.
openaire   +2 more sources

Petri Nets in the Biosciences

it – Information Technology, 2014
Ina Koch   +2 more
openaire   +2 more sources

Feedback control of petri nets based on place invariants

Automatica, 1996
Panos Antsaklis   +2 more
exaly  

Probability in Petri nets

Fundam. Informaticae, 2005
Summary: It is demonstrated that the introduction of probability into Petri nets increases their power, in particular for their reachability sets. To achieve this the definition of accepted languages by probabilistic finite automata or probabilistic Turing machines with complexity restriction has to be modified.
openaire   +2 more sources

Petri nets and industrial applications: A tutorial

IEEE Transactions on Industrial Electronics, 1994
Mengchu Zhou, R Zurawski
exaly  

Home - About - Disclaimer - Privacy