Skip to main content
Log in

Compositional analysis of Petri nets

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Foundations of compositional analysis of Petri nets are presented. This analysis consist of the determination of properties of a given Petri net from the properties of its functional subnets. Compositional analysis covers the investigation of behavioral and structural properties of Petri nets with the help of matrix methods that use fundamental equations and invariants. The exponential acceleration of computations as a function of the dimensionality of a net is obtained.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Google Scholar 

  2. T. Murata, “Petri nets: Properties, analysis, and applications,” Proc. IEEE, 77, No. 4, 41–85 (1989).

    Article  Google Scholar 

  3. A. I. Sleptsov and A. A. Yurasov, Design Automation of Systems for Controlling Flexible Automated Industrial Processes [in Russian], B. N. Malinovskii (ed.), Tekhnika, Kiev (1986).

  4. S. M. Achasova and O. L. Bandman, Correctness of Parallel Computational Processes [in Russian], Nauka, Novosibirsk (1990).

    Google Scholar 

  5. D. A. Zaitsev and A. I. Sleptsov, “State equations and equivalent transformations of timed Petri nets,” Kibern. Sist. Anal., No. 5, 59–76 (1997).

  6. J. M. Toudic, “Linear algebra algorithms for the structural analysis of Petri nets,” Rev. Tech. Thomson CSF, 14, No. 1, 136–156 (1982).

    Google Scholar 

  7. S. L. Kryvyi, “Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers,” Kibern. Sist. Anal., No. 4, 12–36 (1999).

  8. D. A. Zaitsev, “Formal grounding of the Toudic method,” in: Proc. 10th Workshop “ Algorithms and Tools for Petri Nets” (Sept. 26–27, 2003), Eichstaett (Germany) (2003), pp. 184–190.

  9. D. A. Zaitsev, “Subnets with input and output places,” Petri Net Newsletter, 64 (Apr.), 3–6 (2003).

    Google Scholar 

  10. D. A. Zaitsev, “Decomposition of Petri nets,” Kibern. Sist. Anal., No. 5, 131–140 (2004).

  11. D. A. Zaitsev, “Decomposition of the ECMA protocol,” Radiotekhnika: Vseukr. Mezhved. Nauchno-Tekhn. Sb., No. 138, 130–137 (2004).

  12. D. A. Zaitsev, “Verification of Ethernet protocols,” in: Proc. A. S. Popov Academy of Communications, No. 1, 42–48 (2004).

  13. K. Loogheed, Y. Rekhter, and T. J. Watson, A Border Gateway Protocol (BGP), RFC 1105 (1989).

  14. D. A. Zaitsev, “Invariants of timed Petri nets,” Kibern. Sist. Anal., No. 2, 92–106 (2004).

  15. S. L. Kryvyi, “Algorithms of solution of systems of linear Diophantine constraints over the set {0,1},” Kibern. Sist. Anal., No. 5, 58–69 (2003).

  16. S. L. Kryvyi and L. Ye. Matveyeva, “Formal methods of analysis of systems properties,” Kibern. Sist. Anal., No. 2, 15-36 (2003).

  17. D. A. Zaitsev, “Invariants of functional subnets,” in: Proc. A. S. Popov Academy of Communications, No. 4, 57–63 (2003).

  18. D. A. Zaitsev, “Computational complexity of the Toudic method,” in: Artificial Intelligence, 29–37 (2004).

  19. D. A. Zaitsev, Functional Petri Nets, Univ. Paris-Dauphine, Cahier du Lamsade, 224 (Avril) (2005) (www.lamsade.dauphine.fr/cahiers.html).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 143–154, January–February 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zaitsev, D.A. Compositional analysis of Petri nets. Cybern Syst Anal 42, 126–136 (2006). https://doi.org/10.1007/s10559-006-0044-0

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-006-0044-0

Keywords

Navigation