Results 181 to 190 of about 23,744 (217)
Some of the next articles are maybe not open access.
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 +1 more source
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 +1 more source
Acta Informatica, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Best, Eike +2 more
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Best, Eike +2 more
openaire +4 more sources
From Coloured Petri Nets to Object Petri Nets
1995This paper seeks to establish within a formal framework how Coloured Petri Nets can be enhanced to produce Object Petri Nets. It does so by defining a number of intermediate Petri Net formalisms and identifying the features introduced at each step of the development.
openaire +1 more source
Mathematical Structures in Computer Science, 2009
We add mobility to Place-Transition Petri nets: tokens are names for places, and an input token of a transition can be used in its postset to specify a destination. Mobile Petri nets are then further extended to dynamic nets by adding the possibility of creating new nets during the firing of a transition.
ASPERTI, ANDREA, N. Busi
openaire +2 more sources
We add mobility to Place-Transition Petri nets: tokens are names for places, and an input token of a transition can be used in its postset to specify a destination. Mobile Petri nets are then further extended to dynamic nets by adding the possibility of creating new nets during the firing of a transition.
ASPERTI, ANDREA, N. Busi
openaire +2 more sources
2020
We introduce multilabeled Petri nets as an inherently parallel generalization of constraint automata. Composition of multilabeled nets does not suffer from state-space explosions, which makes them an adequate intermediate representation for code generation.
openaire +1 more source
We introduce multilabeled Petri nets as an inherently parallel generalization of constraint automata. Composition of multilabeled nets does not suffer from state-space explosions, which makes them an adequate intermediate representation for code generation.
openaire +1 more source
2019
The author offers a personal account of how Carl Adam Petri explained nets, tokens, and dynamics in the universe.
openaire +2 more sources
The author offers a personal account of how Carl Adam Petri explained nets, tokens, and dynamics in the universe.
openaire +2 more sources
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
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
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 2002
A fundamental criterion of a robust distributed system is its ability to recover from perturbations that can possibly corrupt the state of the system. In a Petri net model, system perturbations may affect the marking of the net in an unpredictable manner.
openaire +1 more source
A fundamental criterion of a robust distributed system is its ability to recover from perturbations that can possibly corrupt the state of the system. In a Petri net model, system perturbations may affect the marking of the net in an unpredictable manner.
openaire +1 more source
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 +1 more source
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 +1 more source