The problem of splitting any given Petri net into functional subnets is considered. The properties of functional subnets and sets that induce them are investigated. An algorithm of polynomial complexity is constructed for decomposition of nets.
KeywordsPetri net subnet decomposition algorithm
Unable to display preview. Download preview PDF.
- 1.Peterson, J. L. 1984Petri Net Theory and the Modelng of SystemsMirMoscow[Russian translation]Google Scholar
- 2.Kotov, V. Ye. 1984Petri NetsNaukaMoscow[in Russian]Google Scholar
- 3.Bandman, M. K., Bandman, O. L., Yesikova, T. N. 1990Territorial-Industrial Complexes: Prediction of the Process of Formation Using Petri NetsNaukaNovosibirsk[in Russian]Google Scholar
- 4.Sleptsov, A. I., Yurasov, A. A. 1986Malinovskii, B. N. eds. Automation of Designing Systems for Controlling Flexible Automated Industrial ProcessesTekhnikaKiev[in Russian]Google Scholar
- 5.D. A. Zaitsev and A. I. Sleptsov, “Visualization of industrial processes in the tooling system of the dispatcher of an engineering plant,” Avtometriya, No. 4, 90–93 (1990).Google Scholar
- 6.D. A. Zaitsev and A. I. Sleptsov, “State equations and equivalent transformations for timed Petri nets,” Kibern. Sist. Anal., No. 5, 59–74 (1997).Google Scholar
- 7.A. Ichikawa, K. Yokoyama and S. Kurogi, “Reachability and control of discrete event systems represented by conflict-free Petri nets,” in: Proc. ISCAS 85, 487–490 (1985).Google Scholar
- 8.Harary, F. 1973Graph TheoryMirMoscow[Russian translation]Google Scholar
- 9.Glushkov, V. M. 1962Synthesis of Digital AutomataFizmatgizMoscow[in Russian]Google Scholar