Have a personal or library account? Click to login
The Formalization of Decision-Free Petri Net Cover

The Formalization of Decision-Free Petri Net

Formalized Mathematics
Volume 22 (2014): Issue 1 (March 2014)
By: Pratima K. Shah,  Pauline N. Kawamoto and  Mariusz Giero  
Open Access
|Mar 2014

References

  1. [1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.
    Search in Google Scholar
  5. [5] Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.
    Search in Google Scholar
  6. [6] Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.
    Search in Google Scholar
  7. [7] Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.
    Search in Google Scholar
  8. [8] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.
    Search in Google Scholar
  9. [9] Pauline N. Kawamoto, Yasushi Fuwa, and Yatsuka Nakamura. Basic Petri net concepts. Formalized Mathematics, 3(2):183-187, 1992.
    Search in Google Scholar
  10. [10] Andrzej Kondracki. Basic properties of rational numbers. Formalized Mathematics, 1(5): 841-845, 1990.
    Search in Google Scholar
  11. [11] Jarosław Kotowicz. Functions and finite sequences of real numbers. Formalized Mathematics, 3(2):275-278, 1992.
    Search in Google Scholar
  12. [12] Robert Milewski. Subsequences of almost, weakly and poorly one-to-one finite sequences. Formalized Mathematics, 13(2):227-233, 2005.
    Search in Google Scholar
  13. [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.10.2478/v10037-011-0022-5
    Search in Google Scholar
  14. [14] Andrzej Trybulec. On the decomposition of finite sequences. Formalized Mathematics, 5 (3):317-322, 1996.
    Search in Google Scholar
  15. [15] Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.
    Search in Google Scholar
  16. [16] Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569-573, 1990.
    Search in Google Scholar
  17. [17] Wojciech A. Trybulec. Pigeon hole principle. Formalized Mathematics, 1(3):575-579, 1990.
    Search in Google Scholar
  18. [18] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.
    Search in Google Scholar
  19. [19] Jiacun Wang. Timed Petri Nets, Theory and Application. Kluwer Academic Publishers, 1998.10.1007/978-1-4615-5537-7
    Search in Google Scholar
  20. [20] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/forma-2014-0004 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 29 - 35
Published on: Mar 30, 2014
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
specification and verification of discrete systems,
Petri net;
Related subjects:
Mathematics,
General mathematics,
Computer sciences,
Computer sciences, other

© 2014 Pratima K. Shah, Pauline N. Kawamoto, Mariusz Giero, published by University of Białystok
This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 License.

Previous articleVolume 22 (2014): Issue 1 (March 2014)Next article