Ordering method for reducing state space in compositional verification
Wan Bok Lee, Tag Gon Kim · 2003
Proposes an efficient ordering method for solving the state explosion problem in compositional verification of discrete event systems. A system to be verified is specified by untimed DEVS (discrete event system specification) formalism. The size of the intermediate state space during the compositional verification is dependent on the sequence of composing system components. Application of this method to some classical verification problems has shown that the size of the intermediate state space during composition is markedly reduced.