An Approach To Computing All Cycles in a Graph

Abstract

Analysis of the set of all cycles in a reachability graph of a system could bring new and useful insight into the system's behavior. This paper presents a method for computation of all cycles in a reachability graph. The method is based on structural reduction of the state space, followed by an encoding - decoding procedure applied to the reduced set of states. The proposed approach is believed to be beneficial with respect to memory constraints.