Results 231 to 240 of about 20,891 (263)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +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
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
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
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
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
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
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 +1 more source
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 +1 more source
2004
A simple example is given of the use of bigraphical reactive systems (BRSs). It provides a behavioural semantics for condition-event Petri nets whose interfaces are named condition nodes, using a simple form of BRS equipped with a labelled transition system and its associated bisimilarity equivalence.
openaire +1 more source
A simple example is given of the use of bigraphical reactive systems (BRSs). It provides a behavioural semantics for condition-event Petri nets whose interfaces are named condition nodes, using a simple form of BRS equipped with a labelled transition system and its associated bisimilarity equivalence.
openaire +1 more source