Skip to main content
SpringerLink
Log in

State equations and equivalent transformations for timed petri nets

  • Published:
Cybernetics and Systems Analysis Aims and scope

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

References

  1. J. L. Peterson, Petri Net Theory and the Modeling of Systems, Prentice Hall, Englewood Cliffs, NJ (1981).

    Google Scholar 

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

    MATH  Google Scholar 

  3. O. L. Bandman, “Behavioral properties of Petri nets (a survey of the French literature),” Tekhn. Kibern., No. 5, 134–150 (1987).

  4. T. Murata, “Petri nets: properties, analysis, applications,” Proc. IEEE,77, No. 4, (1989).

  5. C. V. Ramamorthy and G. S. Ho, “Performance evaluation of asynchronous concurrent systems using Petri nets,” IEEE Trans. Soft. Eng.,6, No. 5, 440–449 (1980).

    Article  Google Scholar 

  6. M. A. Hollyday and M. K. Vernon, “A generalized timed Petri net model for performance analysis,” Int. Workshop on Timed Petri Nets, Torino, Italy, July 1–3 (1985), pp. 181–190.

    Google Scholar 

  7. P. Chretienne, “Executions controlees des resaux de Petri temporises,” Tech. Sci. Inform.,3, 23–31 (1984).

    MATH  Google Scholar 

  8. W. H. Zuberc, “Performance evaluation using extended timed Petri nets,” Int. Workshop on Timed Petri Nets, Torino, Italy, July 1–3 (1985), pp. 272–278.

    Google Scholar 

  9. A. I. Sleptsov and A. A. Yurasov, Computer-Aided Design of Flexible Computer-Aided Manufacturing Systems [in Russian], Tekhnika, Kiev (1986).

    Google Scholar 

  10. A. Ichikawa, K. Yokoyama, and S. Kurogi, “Reachability and control of discrete event systems represent by conflict-free Petri nets,” Proc. ISCAS '85 (1985), pp. 487–490.

    Google Scholar 

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

  12. T. Murata, “State equations, controllability, and maximal matchings of Petri nets,” IEEE Trans. Autom. Contr.,AC-22, No. 3, 412–414 (1977).

    Article  Google Scholar 

  13. L. I. Volgin and V. I. Levin, Continuous Logic, Theory and Application [in Russian], Tallin (1991).

  14. Z. L. Rabinovich, Elementary Operations in Computers [in Russian], Tekhnika, Kiev (1966).

    Google Scholar 

Download references

Authors
  1. D. A. Zaitsev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. I. Sleptsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 59–76, September–October, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zaitsev, D.A., Sleptsov, A.I. State equations and equivalent transformations for timed petri nets. Cybern Syst Anal 33, 659–672 (1997). https://doi.org/10.1007/BF02667189

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02667189

Keywords

Search

Navigation