Аноним

Petri net: различия между версиями

Материал из WikiGrapp
нет описания правки
Нет описания правки
Нет описания правки
 
(не показаны 2 промежуточные версии этого же участника)
Строка 6: Строка 6:
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>.
(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>.


Строка 38: Строка 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.
[[Категория:Сети Петри]]
[[Категория:Граф-модели]]
[[Категория:Теория вычислений]]