Instruments and Systems: Monitoring, Control, and Diagnostics Annotation << Back Reachability Analysis of The Reachability Tree of a Reversible Petri Net A.V. GORDIENKO, D.V. FATKHI One of the most common models for representing parallel interacting processes and structures is the Petri net. From the beginning of the appearance to the present time, a large number of varieties of Petri nets have appeared. Each of these networks is aimed at modeling different systems, taking into account certain features, such as: time parameters, prohibitive conditions, priority processes, and others. In the course of solving problems by computer systems, it is often necessary to return to the previous state, which has already been achieved in the past. The essence is a step-by-step rollback of the system, by modifying further States into the previous one with the help of the computer system itself. To solve such a problem, a reversible Petri net can be used, which is a modification of the classical Petri net. the Work is devoted to solving the problem of reachability analysis of reversible Petri nets by constructing an reachability graph. Schemes based on mathematical apparatus, reversible Petri nets, logical operations such as conjunction and disjunction were constructed. Keywords: Petri net, reversible Petri nets, reachability analysis, reachability tree, logical operation. DOI: 10.25791/pribor.02.2020.1152 Pp. 48-51.