Title :
An Approach To Computing All Cycles in a Graph
Author :
Popescu, Corina ; Lobov, Andrei ; Lastra, José L Martinez
Author_Institution :
Inst. of Production Eng., Tampere Univ. of Technol., Tampere
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.
Keywords :
graph theory; reachability analysis; closed loop systems; encoding-decoding procedure; formal methods; formal validation; formal verification; graph cycles; reachability graph; state space structural reduction; Algorithm design and analysis; Closed loop systems; Decoding; Equations; Memory management; Production engineering; Roentgenium; State-space methods; Terminology; Unified modeling language;
Conference_Titel :
Industrial Informatics, 2006 IEEE International Conference on
Conference_Location :
Singapore
Print_ISBN :
0-7803-9700-2
Electronic_ISBN :
0-7803-9701-0
DOI :
10.1109/INDIN.2006.275842
