683
правки
KVN (обсуждение | вклад) Нет описания правки |
KVN (обсуждение | вклад) Нет описания правки |
||
(не показаны 2 промежуточные версии этого же участника) | |||
Строка 3: | Строка 3: | ||
A ''' Petri net''' is a finite directed graph with two types of nodes, | A ''' Petri net''' is a finite directed graph with two types of nodes, | ||
referred to as '''places''' and '''transitions'''. It is a bipartite graph: every arc | referred to as '''places''' and '''transitions'''. It is a bipartite graph: every arc | ||
goes either from a place to a transition or from a transition to a place. | goes either from a place to a transition or from a transition to a place. | ||
Consider a transition <math>t</math>. Every place <math>p</math> (respectively, <math>q</math>) such that there is an arc from <math>t</math> to <math>p</math> | Consider a transition <math>t</math>. Every place <math>p</math> (respectively, <math>q</math>) such that there is an arc from <math>t</math> to <math>p</math> | ||
(respectively, from <math>q</math> to <math>t</math>) is called an '''input''' | (respectively, from <math>q</math> to <math>t</math>) is called an '''input''' | ||
( | (respectively, an '''output''') '''place''' of <math>t</math>. | ||
The same place can be both an input and an output place of <math>t</math>. | The same place can be both an input and an output place of <math>t</math>. | ||
Строка 39: | Строка 38: | ||
A transition is not enabled if there are not sufficiently many tokens in each | A transition is not enabled if there are not sufficiently many tokens in each | ||
of its input places. | of its input places. | ||
[[Категория:Теория вычислений]] |