Industrial Automatic Control Systems and Controllers Annotation << Back Reverse Petri Net Analysis by Reachability Tree A.V. Gordienko, D.V. Fatkhi In the course of solving problems by computing systems, it is often necessary to return to the previous state, which has already been achieved in the past. The essence is the step-by-step rollback of the system, by modifying further states to the previous state with the help of the computer system itself. A reversible Petri network, a modification of the classical Petri network, can be used to solve such a problem. From the beginning of the appearance to the present time there were a large number of varieties of Petri networks. Each of these networks is aimed at modeling different systems that take into account certain characteristics, such as time parameters, prohibiting conditions, priority of processes and others. The work is devoted to solving the problem of analysis of reachability of reversible Petri networks by method of building reachability graph. Circuits were built based on mathematical apparatus, reversible Petri networks, logical operations such as conjuncture and disjunction. Keywords: Petri net; reversible Petri nets; reachability analysis; reachability tree; logical operation. DOI: 10.25791/asu.3.2020.1167 Pp. 25-28.