1184
правки
Petri net: различия между версиями
Материал из WikiGrapp
нет описания правки
Glk (обсуждение | вклад) (Новая страница: «'''Petri net''' --- сеть Петри. A ''' Petri net''' is a finite directed graph with two types of nodes, referred to as '''places''' and '''transitions'''.…») |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 16: | Строка 16: | ||
Thus, formally, a (marked) Petri net is a quadruple <math>N=(P,T,A,m_0)</math>, where <math>P</math> and <math>T</math> are nonempty | Thus, formally, a (marked) Petri net is a quadruple <math>N=(P,T,A,m_0)</math>, where <math>P</math> and <math>T</math> are nonempty | ||
finite disjoint sets of places and | finite disjoint sets of places and transitions, <math>A</math> is a subset of <math>P \times T \bigcup T\times P</math>. | ||
(It is often also required that the union of the domain and codomain of <math>A</math> equals <math>P\bigcup T</math>; that is, | (It is often also required that the union of the domain and codomain of <math>A</math> equals <math>P\bigcup T</math>; that is, | ||
every place and transition is either the beginning or the end of some arc.) Finally, <math>m_0</math> (initial marking) | every place and transition is either the beginning or the end of some arc.) Finally, <math>m_0</math> (initial marking) | ||
