K-Bounded Petri net

[math]\displaystyle{ \,k }[/math]-Bounded Petri net — [math]\displaystyle{ \,k }[/math]-ограниченная сеть Петри.

Let [math]\displaystyle{ \,N }[/math] be a Petri net with initial marking [math]\displaystyle{ \,m_0 }[/math]. [math]\displaystyle{ \,N }[/math] is called [math]\displaystyle{ \,k }[/math]-bounded if the number of tokens in each place doesn't exceed [math]\displaystyle{ \,k }[/math] for any marking reachable from [math]\displaystyle{ \,m_0 }[/math].

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.