Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Petri net;

Sortuj według:

Ogranicz wyniki do:

The Formalization of Decision-Free Petri Net

100%

Shah P. K., Kawamoto P. N., Giero M.

Formalized Mathematics

2014

tom 22

nr 1

29-35

In this article we formalize the definition of Decision-Free Petri Net (DFPN) presented in [19]. Then we formalize the concept of directed path and directed circuit nets in Petri nets to prove properties of DFPN. We also present the definition of firing transitions and transition sequences with natural numbers marking that always check whether transition is enabled or not and after firing it only removes the available tokens (i.e., it does not remove from zero number of tokens). At the end of this article, we show that the total number of tokens in a circuit of decision-free Petri net always remains the same after firing any sequences of the transition.

Ograniczanie wyników

1 Formalized Mathematics

1 Giero M.

1 Kawamoto P. N.

1 Shah P. K.

1 2014

Wyniki wyszukiwania

The Formalization of Decision-Free Petri Net