The Formalization of Decision-Free Petri Net

• Autorzy: Pratima K. Shah , Pauline N. Kawamoto , Mariusz Giero
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

specification and verification of discrete systems; Petri net;

• Wydawca: De Gruyter Open
• Czasopismo: Formalized Mathematics
• Rocznik: 2014
• Tom: 22
• Numer: 1
• Strony: 29-35

Twórcy

autor

Pratima K. Shah

• Shinshu University Nagano, Japan

autor

Pauline N. Kawamoto

• Shinshu University Nagano, Japan

autor

Mariusz Giero

• University of Białystok Poland

Bibliografia

• [1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.
• [2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.
• [3] Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.
• [4] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.
• [5] Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.
• [6] Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.
• [7] Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.
• [8] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.
• [9] Pauline N. Kawamoto, Yasushi Fuwa, and Yatsuka Nakamura. Basic Petri net concepts. Formalized Mathematics, 3(2):183-187, 1992.
• [10] Andrzej Kondracki. Basic properties of rational numbers. Formalized Mathematics, 1(5): 841-845, 1990.
• [11] Jarosław Kotowicz. Functions and finite sequences of real numbers. Formalized Mathematics, 3(2):275-278, 1992.
• [12] Robert Milewski. Subsequences of almost, weakly and poorly one-to-one finite sequences. Formalized Mathematics, 13(2):227-233, 2005.
• [13] Karol Pak. Continuity of barycentric coordinates in Euclidean topological spaces. Formalized Mathematics, 19(3):139-144, 2011. doi:10.2478/v10037-011-0022-5.[Crossref]
• [14] Andrzej Trybulec. On the decomposition of finite sequences. Formalized Mathematics, 5 (3):317-322, 1996.
• [15] Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.
• [16] Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569-573, 1990.
• [17] Wojciech A. Trybulec. Pigeon hole principle. Formalized Mathematics, 1(3):575-579, 1990.
• [18] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.
• [19] Jiacun Wang. Timed Petri Nets, Theory and Application. Kluwer Academic Publishers, 1998.
• [20] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990.

Identyfikatory

DOI

10.2478/forma-2014-0004