Results 231 to 240 of about 4,712 (265)
Some of the next articles are maybe not open access.
Acta Informatica, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haddad, Serge, Poitrenaud, Denis
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haddad, Serge, Poitrenaud, Denis
openaire +3 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 +2 more sources
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 +2 more sources
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
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
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
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
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
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
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
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