Skip to main content
SpringerLink
Log in

Universal petri net

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A universal inhibitor Petri net executing an arbitrary given inhibitor Petri net is constructed. An inhibitor Petri net graph, its marking, and transition firing sequence are encoded as 10 scalar nonnegative integer variables and are represented by the corresponding places of the universal net. An algorithm using only these scalar variables and executing an arbitrary inhibitor net is developed based on the state equation and is encoded by the universal inhibitor Petri net. Subnets that implement arithmetic, comparison, and copy operations are employed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. Agerwala, “A complete model for representing the coordination of asynchronous processes,” Hopkins Computer Science Program, Res. Rep., No. 32, John Hopkins University, Baltimore (1974).

  2. V. E. Kotov, Petri Nets [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  3. Rolf Herken (ed.), The Universal Turing machine: A half-century survey, Springer, Wien–New York (1994).

  4. D. A. Zaitsev “Universal inhibitor Petri net,” in: Proc. 17th German Workshop on Algorithms and Tools for Petri Nets, Cottbus, Germany (2010), pp. 1–15.

  5. A. I. Sleptsov and A. A. Yurasov, Automation of Designing Control Systems of Flexible Computer-Aided Productions [in Russian], Tekhnika, Kiev (1986).

    Google Scholar 

  6. A. I. Sleptsov, “State equations and equivalent transformations of loaded Petri nets (algebraic approach),” in: Proc. and Comm. of All-Union Conf. “Formal Models of Parallel Computations,” Novosibirsk (1988), pp. 151–158.

  7. D. A. Zaizev, “Compositional analysis of Petri nets,” Cybernetics and Systems Analysis, Vol. 42, No. 1, 126–136 (2006).

  8. D. A. Zaitsev, “Complexity of a universal inhibitor Petri net,” in: Proc. 18th German Workshop on Algorithms and Tools for Petri Nets, Hagen, Germany (2011), pp. 62–71.

  9. M. Minsky, “Size and structure of universal Turing machines using tag systems,” in: Recursive Function Theory, Symposium in Pure Mathematics, Vol. 5, AMS, Provelence (1962), pp. 229–238.

  10. Y. Rogozhin, “Small universal Turing machines,” TCS, Vol. 168, No. 2, 215–240 (1996).

Download references

Author information

Authors and Affiliations

  1. International Humanitarian University, Odessa, Ukraine

    D. A. Zaitsev

Authors
  1. D. A. Zaitsev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. A. Zaitsev.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 24–39, July–August 2012.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zaitsev, D.A. Universal petri net. Cybern Syst Anal 48, 498–511 (2012). https://doi.org/10.1007/s10559-012-9429-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-012-9429-4

Keywords

Search

Navigation