In: Soviet Journal of Computer and Systems Sciences, Vol. 26, No. 3, pages 66-77. 1988.
Also in: (Source:) Izv. Akad. Nauk SSSR Tekhn. Kibernet., No. 5, pages 151-163. 1987.
Abstract: The paper introduces an interpretation of Petri nets as collections of finite automata connected by certain constraints. A sufficient equivalence condition, which makes it possible to apply to Petri nets the apparatus of finite-automation equivalent transformations, is proven on its basis. Conditions for Petri net liveliness are proven and an algorithm for testing for these conditions is defined.